oj.uz

Submission #55131

# Submission time Handle Problem Language Result Execution time Memory
55131 2018-07-06T05:50:35 Z 김세빈(#1527) None (JOI14_ho_t1) C++11
100 / 100
 84 ms 5612 KB 
#include <bits/stdc++.h>

using namespace std;

int K[1010][1010];
char str[1010][1010];
char emb[2][2];
int n, m, ans, s;

int main()
{
	int i, j, a, b, c;
	
	scanf("%d%d", &n, &m);
	
	for(i=0;i<n;i++){
		scanf("%s" ,str[i]);
	}
	
	scanf("%s%s",emb[0], emb[1]);
	
	for(i=1;i<n;i++){
		for(j=1;j<m;j++){
			K[i][j] = (str[i-1][j-1] == emb[0][0] && str[i-1][j] == emb[0][1] && str[i][j-1] == emb[1][0] && str[i][j] == emb[1][1]);
			s += K[i][j];
		}
	}
	
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			a = b = c = s;
			
			{
				if(i && j) a += (str[i-1][j-1] == emb[0][0] && str[i-1][j] == emb[0][1] && str[i][j-1] == emb[1][0] && 'J' == emb[1][1]) - K[i][j];
				if(i && j+1<m) a += (str[i-1][j] == emb[0][0] && str[i-1][j+1] == emb[0][1] && 'J' == emb[1][0] && str[i][j+1] == emb[1][1]) - K[i][j+1];
				if(i+1<n && j) a += (str[i][j-1] == emb[0][0] && 'J' == emb[0][1] && str[i+1][j-1] == emb[1][0] && str[i+1][j] == emb[1][1]) - K[i+1][j];
				if(i+1<n && j+1<m) a += ('J' == emb[0][0] && str[i][j+1] == emb[0][1] && str[i+1][j] == emb[1][0] && str[i+1][j+1] == emb[1][1]) - K[i+1][j+1];
			}
			
			{
				if(i && j) b += (str[i-1][j-1] == emb[0][0] && str[i-1][j] == emb[0][1] && str[i][j-1] == emb[1][0] && 'O' == emb[1][1]) - K[i][j];
				if(i && j+1<m) b += (str[i-1][j] == emb[0][0] && str[i-1][j+1] == emb[0][1] && 'O' == emb[1][0] && str[i][j+1] == emb[1][1]) - K[i][j+1];
				if(i+1<n && j) b += (str[i][j-1] == emb[0][0] && 'O' == emb[0][1] && str[i+1][j-1] == emb[1][0] && str[i+1][j] == emb[1][1]) - K[i+1][j];
				if(i+1<n && j+1<m) b += ('O' == emb[0][0] && str[i][j+1] == emb[0][1] && str[i+1][j] == emb[1][0] && str[i+1][j+1] == emb[1][1]) - K[i+1][j+1];
			}
			
			{
				if(i && j) c += (str[i-1][j-1] == emb[0][0] && str[i-1][j] == emb[0][1] && str[i][j-1] == emb[1][0] && 'I' == emb[1][1]) - K[i][j];
				if(i && j+1<m) c += (str[i-1][j] == emb[0][0] && str[i-1][j+1] == emb[0][1] && 'I' == emb[1][0] && str[i][j+1] == emb[1][1]) - K[i][j+1];
				if(i+1<n && j) c += (str[i][j-1] == emb[0][0] && 'I' == emb[0][1] && str[i+1][j-1] == emb[1][0] && str[i+1][j] == emb[1][1]) - K[i+1][j];
				if(i+1<n && j+1<m) c += ('I' == emb[0][0] && str[i][j+1] == emb[0][1] && str[i+1][j] == emb[1][0] && str[i+1][j+1] == emb[1][1]) - K[i+1][j+1];
			}
			
			ans = max({ans, a, b, c});
		}
	}
	
	printf("%d\n", ans);
	
	return 0;
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
2014_ho_t1.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s" ,str[i]);
   ~~~~~^~~~~~~~~~~~~~
2014_ho_t1.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s%s",emb[0], emb[1]);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Correct 2 ms 484 KB Output is correct
9 Correct 2 ms 484 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 3 ms 672 KB Output is correct
15 Correct 2 ms 672 KB Output is correct
16 Correct 3 ms 672 KB Output is correct
17 Correct 3 ms 672 KB Output is correct
18 Correct 3 ms 800 KB Output is correct
19 Correct 3 ms 800 KB Output is correct
20 Correct 2 ms 800 KB Output is correct
21 Correct 3 ms 800 KB Output is correct
22 Correct 3 ms 800 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Correct 2 ms 484 KB Output is correct
9 Correct 2 ms 484 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 3 ms 672 KB Output is correct
15 Correct 2 ms 672 KB Output is correct
16 Correct 3 ms 672 KB Output is correct
17 Correct 3 ms 672 KB Output is correct
18 Correct 3 ms 800 KB Output is correct
19 Correct 3 ms 800 KB Output is correct
20 Correct 2 ms 800 KB Output is correct
21 Correct 3 ms 800 KB Output is correct
22 Correct 3 ms 800 KB Output is correct
23 Correct 2 ms 800 KB Output is correct
24 Correct 3 ms 800 KB Output is correct
25 Correct 3 ms 800 KB Output is correct
26 Correct 2 ms 800 KB Output is correct
27 Correct 2 ms 800 KB Output is correct
28 Correct 2 ms 800 KB Output is correct
29 Correct 3 ms 800 KB Output is correct
30 Correct 4 ms 1004 KB Output is correct
31 Correct 3 ms 1004 KB Output is correct
32 Correct 3 ms 1004 KB Output is correct
33 Correct 3 ms 1004 KB Output is correct
34 Correct 2 ms 1004 KB Output is correct
35 Correct 2 ms 1004 KB Output is correct
36 Correct 2 ms 1004 KB Output is correct
37 Correct 5 ms 1516 KB Output is correct
38 Correct 5 ms 1516 KB Output is correct
39 Correct 6 ms 1516 KB Output is correct
40 Correct 6 ms 1516 KB Output is correct
41 Correct 46 ms 5484 KB Output is correct
42 Correct 65 ms 5552 KB Output is correct
43 Correct 52 ms 5552 KB Output is correct
44 Correct 45 ms 5552 KB Output is correct
45 Correct 52 ms 5552 KB Output is correct
46 Correct 68 ms 5552 KB Output is correct
47 Correct 27 ms 5552 KB Output is correct
48 Correct 62 ms 5612 KB Output is correct
49 Correct 84 ms 5612 KB Output is correct
50 Correct 68 ms 5612 KB Output is correct