Mujin Programming Challenge 2017

Submission #1365428

Source codeソースコード

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define fill(x, y) memset(x, y, sizeof x)
#define copy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair < int, int > pa;

inline int read()
{
	int sc = 0, f = 1; char ch = getchar();
	while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') sc = sc * 10 + ch - '0', ch = getchar();
	return sc * f;
}

const int MAXN = 505;
const int INF = INT_MAX;

int n, a[MAXN][MAXN], ans = INF, c, cnt;

int main()
{
#ifdef wxh010910
	freopen("data.in", "r", stdin);
#endif
	n = read();
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n; a[i][j ++] = c == '#')
			for (c = getchar(); c != '#' && c != '.'; c = getchar());
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n; j ++)
			if (!a[j][i])
			{
				cnt ++;
				break;
			}
	for (int i = 1; i <= n; i ++)
	{
		int ret = 0, f = 0;
		for (int j = 1; j <= n; j ++)
			if (a[i][j])
			{
				f = 1;
				break;
			}
		if (!f) continue;
		for (int j = 1; j <= n; j ++)
			if (a[j][i])
			{
				f = 0;
				break;
			}
		if (f) ret ++;
		for (int j = 1; j <= n; j ++) ret += !a[i][j];
		ans = min(ans, ret + cnt);
	}
	if (ans == INF) ans = -1;
	return printf("%d\n", ans), 0;
}

Submission

Task問題 B - Row to Column
User nameユーザ名 wxh010910
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1300
Source lengthソースコード長 1373 Byte
File nameファイル名
Exec time実行時間 5 ms
Memory usageメモリ使用量 1280 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 4 ms 1280 KB
2_01.txt AC 4 ms 1280 KB
2_02.txt AC 4 ms 1280 KB
2_03.txt AC 4 ms 1280 KB
2_04.txt AC 4 ms 1280 KB
2_05.txt AC 4 ms 1280 KB
2_06.txt AC 4 ms 1280 KB
2_07.txt AC 4 ms 1024 KB
2_08.txt AC 5 ms 1280 KB
2_09.txt AC 4 ms 1152 KB
2_10.txt AC 4 ms 1152 KB
2_11.txt AC 5 ms 1280 KB
2_12.txt AC 5 ms 1152 KB
2_13.txt AC 4 ms 1152 KB
2_14.txt AC 4 ms 1152 KB
2_15.txt AC 4 ms 1152 KB
2_16.txt AC 4 ms 1152 KB
2_17.txt AC 4 ms 1152 KB
2_18.txt AC 3 ms 1024 KB
2_19.txt AC 4 ms 1152 KB
2_20.txt AC 3 ms 1024 KB
2_21.txt AC 3 ms 1024 KB
2_22.txt AC 4 ms 1280 KB