Submission #1135150


Source Code Expand

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstdio>
#include<vector>
#include<cctype>
#include<cstdlib>
#include<cstring>
#include<utility>
#include<algorithm>
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define For(i,x,y) for(int i=((int)x);i<=((int)y);i++)
#define Dep(i,y,x) for(int i=((int)y);i>=((int)x);i--)
#define Rep(i,x) for (int y,i=head[x];i;i=E[i].nxt)
using namespace std;
 
const int mod=1000000007;
const int inf=1000000009;
 
typedef double db;
typedef long long ll;
typedef vector<int> VI;
typedef unsigned int uint;
typedef pair<int,int> pii;
 
int rd() {
	char c=getchar(); int t=0,f=1;
	while (!isdigit(c)) f=(c=='-')?-1:1,c=getchar();
	while (isdigit(c)) t=t*10+c-48,c=getchar(); return t*f;
}
void wt(int x) {
	if (x<0) putchar('-'),wt(-x);
	else { if (x>9) wt(x/10); putchar(x%10+48); }
}
 
const int N=515;
char s[N][N]; int n,Min=inf,l,ok[N],flag,Ans;
 
int main() {
	n=rd();
	For (i,1,n) {
		scanf("%s",s[i]+1);
		For (j,1,n) if (s[i][j]=='#') ok[j]=1;
	}
	For (i,1,n) {
		l=0;
		For (j,1,n) if (s[i][j]=='#') l++;
		if (l) Min=min(Min,n-l+1-ok[i]); 
	}
	if (Min==inf) return puts("-1"),0;
	
	Ans+=Min;
	For (j,1,n) {
		flag=0;
		For (i,1,n) if (s[i][j]!='#')
			{ flag=1; break; }
		Ans+=flag;
	}
	printf("%d\n",Ans);
	return 0;
}

Submission Info

Submission Time
Task B - Row to Column
User Ajatar
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1383 Byte
Status AC
Exec Time 3 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",s[i]+1);
                     ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 1000 / 1000
Status
AC × 5
AC × 20
AC × 43
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 0 ms 128 KB
0_03.txt AC 0 ms 128 KB
0_04.txt AC 0 ms 128 KB
1_00.txt AC 0 ms 128 KB
1_01.txt AC 0 ms 128 KB
1_02.txt AC 0 ms 128 KB
1_03.txt AC 0 ms 128 KB
1_04.txt AC 0 ms 128 KB
1_05.txt AC 0 ms 128 KB
1_06.txt AC 0 ms 128 KB
1_07.txt AC 0 ms 128 KB
1_08.txt AC 0 ms 128 KB
1_09.txt AC 0 ms 128 KB
1_10.txt AC 1 ms 128 KB
1_11.txt AC 0 ms 128 KB
1_12.txt AC 0 ms 128 KB
1_13.txt AC 0 ms 128 KB
1_14.txt AC 0 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 3 ms 384 KB
2_09.txt AC 2 ms 384 KB
2_10.txt AC 2 ms 384 KB
2_11.txt AC 3 ms 384 KB
2_12.txt AC 3 ms 384 KB
2_13.txt AC 3 ms 384 KB
2_14.txt AC 2 ms 384 KB
2_15.txt AC 1 ms 384 KB
2_16.txt AC 1 ms 384 KB
2_17.txt AC 1 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