提出 #53008198

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int H, W;
char S[1024][1024];
char stop[1024][1024];
int gen = 0;
int visited[1024][1024];
int dfs(int y, int x) {
  int cnt;
  if (y < 0 || H <= y || x < 0 || W <= x) return 0;
  if (visited[y][x] == gen) return 0;
  if (S[y][x] == '#') return 0;
  visited[y][x] = gen;
  cnt = 1;
  if (!stop[y][x]) {
    cnt += dfs(y - 1, x);
    cnt += dfs(y + 1, x);
    cnt += dfs(y, x - 1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int H, W;
char S[1024][1024];

char stop[1024][1024];

int gen = 0;
int visited[1024][1024];

int dfs(int y, int x) {
	int cnt;
	if (y < 0 || H <= y || x < 0 || W <= x) return 0;
	if (visited[y][x] == gen) return 0;
	if (S[y][x] == '#') return 0;
	visited[y][x] = gen;
	cnt = 1;
	if (!stop[y][x]) {
		cnt += dfs(y - 1, x);
		cnt += dfs(y + 1, x);
		cnt += dfs(y, x - 1);
		cnt += dfs(y, x + 1);
	}
	return cnt;
}

int main(void) {
	int i, j;
	int ans = 0;
	if (scanf("%d%d", &H, &W) != 2) return 1;
	for (i = 0; i < H; i++) {
		if (scanf("%1023s", S[i]) != 1) return 1;
	}
	for (i = 0; i < H; i++) {
		for (j = 0; j < W; j++) {
			int this_stop = 0;
			this_stop = this_stop || (i > 0 && S[i - 1][j] == '#');
			this_stop = this_stop || (i + 1 < H && S[i + 1][j] == '#');
			this_stop = this_stop || (j > 0 && S[i][j - 1] == '#');
			this_stop = this_stop || (j + 1 < W && S[i][j + 1] == '#');
			stop[i][j] = this_stop;
		}
	}
	for (i = 0; i < H; i++) {
		for (j = 0; j < W; j++) {
			if (S[i][j] != '#') {
				int candidate;
				gen++;
				candidate = dfs(i, j);
				if (candidate > ans) ans = candidate;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

提出情報

ジャッジ結果