Submission #532272

# Submission time Handle Problem Language Result Execution time Memory
532272 2022-03-02T16:11:37 Z rainboy None (JOI14_ho_t1) C
30 / 100
1000 ms 400 KB
#include <stdio.h>

#define N	1000
#define M	1000

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

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

	cnt = 0;
	for (i = 0; i + 1 < n; i++)
		for (j = 0; j + 1 < m; j++) {
			int match;

			match = 1;
			for (i_ = 0; i_ < 2; i_++)
				for (j_ = 0; j_ < 2; j_++)
					if (cc[i + i_][j + j_] != aa[i_][j_]) {
						match = 0;
						break;
					}
			if (match)
				cnt++;
		}
	return cnt;
}

int main() {
	static char cc[N][M + 1], aa[2][3];
	int n, m, i, j, 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]);
	ans = 0;
	for (i = 0; i < n; i++)
		for (j = 0; j < m; j++) {
			char c = cc[i][j];

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

Compilation message

2014_ho_t1.c: In function 'main':
2014_ho_t1.c:33:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
2014_ho_t1.c:35:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   scanf("%s", cc[i]);
      |   ^~~~~~~~~~~~~~~~~~
2014_ho_t1.c:37:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |   scanf("%s", aa[i]);
      |   ^~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 1 ms 280 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 284 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 280 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 7 ms 284 KB Output is correct
14 Correct 7 ms 312 KB Output is correct
15 Correct 26 ms 208 KB Output is correct
16 Correct 73 ms 400 KB Output is correct
17 Correct 62 ms 312 KB Output is correct
18 Correct 20 ms 208 KB Output is correct
19 Correct 71 ms 308 KB Output is correct
20 Correct 15 ms 320 KB Output is correct
21 Correct 28 ms 312 KB Output is correct
22 Correct 28 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 1 ms 280 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 284 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 280 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 7 ms 284 KB Output is correct
14 Correct 7 ms 312 KB Output is correct
15 Correct 26 ms 208 KB Output is correct
16 Correct 73 ms 400 KB Output is correct
17 Correct 62 ms 312 KB Output is correct
18 Correct 20 ms 208 KB Output is correct
19 Correct 71 ms 308 KB Output is correct
20 Correct 15 ms 320 KB Output is correct
21 Correct 28 ms 312 KB Output is correct
22 Correct 28 ms 332 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 284 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 43 ms 208 KB Output is correct
28 Correct 60 ms 312 KB Output is correct
29 Correct 24 ms 312 KB Output is correct
30 Correct 255 ms 368 KB Output is correct
31 Execution timed out 1080 ms 336 KB Time limit exceeded
32 Halted 0 ms 0 KB -