답안 #532274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532274 2022-03-02T16:15:40 Z rainboy JOI 문장 (JOI14_ho_t1) C
100 / 100
108 ms 2284 KB
#include <stdio.h>

#define N	1000
#define M	1000

int max(int a, int b) { return a > b ? a : b; }

int match(char cc[][M + 1], char aa[][3], int n, int m, int i, int j) {
	int i_, j_;

	if (i < 0 || j < 0 || i + 1 == n || j + 1 == m)
		return 0;
	for (i_ = 0; i_ < 2; i_++)
		for (j_ = 0; j_ < 2; j_++)
			if (cc[i + i_][j + j_] != aa[i_][j_])
				return 0;
	return 1;
}

int match_(char cc[][M + 1], char aa[][3], int n, int m, int i, int j) {
	return match(cc, aa, n, m, i - 1, j - 1) + match(cc, aa, n, m, i - 1, j)
		+ match(cc, aa, n, m, i, j - 1) + match(cc, aa, n, m, i, j);
}

int main() {
	static char cc[N][M + 1], aa[2][3];
	int n, m, i, j, cnt, ans;

	scanf("%d%d", &n, &m);
	for (i = 0; i < n; i++)
		scanf("%s", cc[i]);
	for (i = 0; i < 2; i++)
		scanf("%s", aa[i]);
	cnt = 0;
	for (i = 0; i < n; i++)
		for (j = 0; j < m; j++)
			cnt += match(cc, aa, n, m, i, j);
	ans = 0;
	for (i = 0; i < n; i++)
		for (j = 0; j < m; j++) {
			char c = cc[i][j];
			int k = match_(cc, aa, n, m, i, j);

			cc[i][j] = 'J';
			ans = max(ans, cnt - k + match_(cc, aa, n, m, i, j));
			cc[i][j] = 'O';
			ans = max(ans, cnt - k + match_(cc, aa, n, m, i, j));
			cc[i][j] = 'I';
			ans = max(ans, cnt - k + match_(cc, aa, n, m, i, j));
			cc[i][j] = c;
		}
	printf("%d\n", ans);
	return 0;
}

Compilation message

2014_ho_t1.c: In function 'main':
2014_ho_t1.c:29:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
2014_ho_t1.c:31:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   scanf("%s", cc[i]);
      |   ^~~~~~~~~~~~~~~~~~
2014_ho_t1.c:33:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   scanf("%s", aa[i]);
      |   ^~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 288 KB Output is correct
33 Correct 2 ms 336 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 5 ms 420 KB Output is correct
38 Correct 4 ms 416 KB Output is correct
39 Correct 5 ms 464 KB Output is correct
40 Correct 5 ms 484 KB Output is correct
41 Correct 60 ms 2248 KB Output is correct
42 Correct 101 ms 2208 KB Output is correct
43 Correct 99 ms 2124 KB Output is correct
44 Correct 83 ms 2208 KB Output is correct
45 Correct 108 ms 2144 KB Output is correct
46 Correct 102 ms 2120 KB Output is correct
47 Correct 56 ms 2212 KB Output is correct
48 Correct 76 ms 2284 KB Output is correct
49 Correct 93 ms 2208 KB Output is correct
50 Correct 98 ms 2224 KB Output is correct