Mujin Programming Challenge 2017

Submission #1519207

Source codeソースコード

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 505;

int n;
char a[MAXN][MAXN];
int cnt1[MAXN], cnt2[MAXN];

int main(){
	cin >> n;
	for(int i=0; i<n; i++) cin >> a[i];
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] == '#'){
				cnt1[i]++;
				cnt2[j]++;
			}
		}
	}
	int ans = 1e9;
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] == '#'){
				ans = min(ans, n - cnt1[j]);
				ans = min(ans, n + 1 - cnt1[i]);
			}
		}
	}
	if(ans > 1e8){
		puts("-1");
		return 0;
	}
	ans += n - count(cnt2, cnt2 + n, n);
	cout << ans << endl;
}

Submission

Task問題 B - Row to Column
User nameユーザ名 koosaga
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1300
Source lengthソースコード長 668 Byte
File nameファイル名
Exec time実行時間 10 ms
Memory usageメモリ使用量 512 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt,0_03.txt,0_04.txt
Subtask 300 / 300 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 1000 / 1000 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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 9 ms 512 KB
2_01.txt AC 10 ms 512 KB
2_02.txt AC 9 ms 512 KB
2_03.txt AC 9 ms 512 KB
2_04.txt AC 9 ms 512 KB
2_05.txt AC 9 ms 512 KB
2_06.txt AC 9 ms 512 KB
2_07.txt AC 7 ms 512 KB
2_08.txt AC 10 ms 512 KB
2_09.txt AC 9 ms 512 KB
2_10.txt AC 9 ms 512 KB
2_11.txt AC 10 ms 512 KB
2_12.txt AC 10 ms 512 KB
2_13.txt AC 9 ms 512 KB
2_14.txt AC 9 ms 512 KB
2_15.txt AC 7 ms 512 KB
2_16.txt AC 8 ms 512 KB
2_17.txt AC 7 ms 512 KB
2_18.txt AC 6 ms 384 KB
2_19.txt AC 9 ms 512 KB
2_20.txt AC 7 ms 512 KB
2_21.txt AC 6 ms 384 KB
2_22.txt AC 9 ms 512 KB