Submission #1131245
Source Code Expand
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head
const int N=510;
int n,col[N],row[N];
char s[N][N];
int main() {
scanf("%d",&n);
rep(i,0,n) {
scanf("%s",s[i]);
rep(j,0,n) {
col[j]+=(s[i][j]=='#');
row[i]+=(s[i][j]=='#');
}
}
bool emp=1;
rep(i,0,n) if (row[i]!=0) emp=0;
if (emp) {
puts("-1");
return 0;
}
int ret=n*2;
rep(i,0,n) {
if (row[i]==n) {
int cnt=0;
rep(j,0,n) if (col[j]!=n) cnt++;
ret=min(ret,cnt);
} else {
int cnt=0;
if (col[i]==0) cnt++;
rep(j,0,n) if (s[i][j]=='.') cnt++;
rep(j,0,n) if (col[j]!=n) cnt++;
ret=min(ret,cnt);
}
}
printf("%d\n",ret);
}
Submission Info
Submission Time
2017-02-25 21:15:42+0900
Task
B - Row to Column
User
mjy0724
Language
C++14 (GCC 5.4.1)
Score
1300
Code Size
1264 Byte
Status
AC
Exec Time
2 ms
Memory
384 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:30:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:32:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s[i]);
^
Judge Result
Set Name
Sample
Subtask
All
Score / Max Score
0 / 0
300 / 300
1000 / 1000
Status
Set Name
Test Cases
Sample
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
Subtask
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt
All
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt
Case Name
Status
Exec Time
Memory
0_00.txt
AC
1 ms
128 KB
0_01.txt
AC
1 ms
128 KB
0_02.txt
AC
1 ms
128 KB
0_03.txt
AC
1 ms
128 KB
0_04.txt
AC
1 ms
128 KB
1_00.txt
AC
1 ms
128 KB
1_01.txt
AC
1 ms
128 KB
1_02.txt
AC
1 ms
128 KB
1_03.txt
AC
1 ms
128 KB
1_04.txt
AC
1 ms
128 KB
1_05.txt
AC
1 ms
128 KB
1_06.txt
AC
1 ms
128 KB
1_07.txt
AC
1 ms
128 KB
1_08.txt
AC
1 ms
128 KB
1_09.txt
AC
1 ms
128 KB
1_10.txt
AC
1 ms
128 KB
1_11.txt
AC
1 ms
128 KB
1_12.txt
AC
1 ms
128 KB
1_13.txt
AC
1 ms
128 KB
1_14.txt
AC
1 ms
128 KB
2_00.txt
AC
2 ms
384 KB
2_01.txt
AC
2 ms
384 KB
2_02.txt
AC
2 ms
384 KB
2_03.txt
AC
2 ms
384 KB
2_04.txt
AC
2 ms
384 KB
2_05.txt
AC
2 ms
384 KB
2_06.txt
AC
2 ms
384 KB
2_07.txt
AC
2 ms
384 KB
2_08.txt
AC
2 ms
384 KB
2_09.txt
AC
2 ms
384 KB
2_10.txt
AC
2 ms
384 KB
2_11.txt
AC
2 ms
384 KB
2_12.txt
AC
2 ms
384 KB
2_13.txt
AC
2 ms
384 KB
2_14.txt
AC
2 ms
384 KB
2_15.txt
AC
2 ms
384 KB
2_16.txt
AC
2 ms
384 KB
2_17.txt
AC
2 ms
384 KB
2_18.txt
AC
1 ms
384 KB
2_19.txt
AC
2 ms
384 KB
2_20.txt
AC
1 ms
384 KB
2_21.txt
AC
1 ms
384 KB
2_22.txt
AC
2 ms
384 KB