Submission #2148804


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

#define N 1200

int n,sum,ans,l[N],c[N];
char s[N][N];

int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%s",s[i]+1);
		for (int j=1;j<=n;j++) sum+=s[i][j]=='#';
	}
	if (!sum){puts("-1"); return 0;}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			l[i]+=s[i][j]=='#',c[j]+=s[i][j]=='#';
	ans=n*n; sum=0;
	for (int i=1;i<=n;i++) if (c[i]!=n) sum++;
	for (int i=1;i<=n;i++){
		int tmp=n-l[i]+(c[i]?0:1);
		ans=min(ans,tmp+sum);
	}
	printf("%d\n",ans);
	
	return 0;
}
			

Submission Info

Submission Time
Task B - Row to Column
User qiqi20021026
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 561 Byte
Status AC
Exec Time 2 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:13: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 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
2_00.txt AC 2 ms 768 KB
2_01.txt AC 2 ms 896 KB
2_02.txt AC 2 ms 896 KB
2_03.txt AC 2 ms 896 KB
2_04.txt AC 2 ms 896 KB
2_05.txt AC 2 ms 896 KB
2_06.txt AC 2 ms 896 KB
2_07.txt AC 2 ms 768 KB
2_08.txt AC 2 ms 768 KB
2_09.txt AC 2 ms 768 KB
2_10.txt AC 2 ms 768 KB
2_11.txt AC 2 ms 896 KB
2_12.txt AC 2 ms 768 KB
2_13.txt AC 2 ms 768 KB
2_14.txt AC 2 ms 768 KB
2_15.txt AC 2 ms 768 KB
2_16.txt AC 2 ms 768 KB
2_17.txt AC 2 ms 768 KB
2_18.txt AC 2 ms 768 KB
2_19.txt AC 2 ms 768 KB
2_20.txt AC 2 ms 768 KB
2_21.txt AC 2 ms 768 KB
2_22.txt AC 2 ms 896 KB