oj.uz

답안 #958249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958249 2024-04-05T08:28:32 Z MilosMilutinovic JOI 문장 (JOI14_ho_t1) C++14
100 / 100
 18 ms 14428 KB 
#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,m;
char s[1005][1005],t[2][2];
int c[1005][1005][3];

int cod(char c){
	if(c=='J') return 0;
	if(c=='O') return 1;
	if(c=='I') return 2;
}

int main(){
	n=readint(); m=readint();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			s[i][j]=getchar();
			while(s[i][j]<'A'||s[i][j]>'Z') s[i][j]=getchar();
		}
	}
	for(int i=0;i<2;i++) scanf("%s",t+i);
	int ans=0;
	for(int i=1;i<n;i++){
		for(int j=1;j<m;j++){
			int cnt=0;
			for(int x=0;x<2;x++){
				for(int y=0;y<2;y++){
					if(s[i+x][j+y]!=t[x][y]) cnt++;
				}
			}
			if(cnt>1) continue;
			if(cnt==0){
				ans++;
				continue;
			}
			for(int x=0;x<2;x++){
				for(int y=0;y<2;y++){
					if(s[i+x][j+y]!=t[x][y]) c[i+x][j+y][cod(t[x][y])]++;
				}
			}
		}
	}
	int mx=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			for(int t=0;t<3;t++) chkmax(mx,c[i][j][t]);
		}
	}
	printf("%d\n",ans+mx);
	return 0;
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:44:31: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[2]' [-Wformat=]
   44 |  for(int i=0;i<2;i++) scanf("%s",t+i);
      |                              ~^  ~~~
      |                               |   |
      |                               |   char (*)[2]
      |                               char*
2014_ho_t1.cpp: In function 'int cod(char)':
2014_ho_t1.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^
2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:44:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |  for(int i=0;i<2;i++) scanf("%s",t+i);
      |                       ~~~~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2904 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4536 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2904 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4536 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 1 ms 2496 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2496 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 1 ms 2648 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2400 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6812 KB Output is correct
41 Correct 11 ms 4292 KB Output is correct
42 Correct 15 ms 14428 KB Output is correct
43 Correct 16 ms 14180 KB Output is correct
44 Correct 10 ms 3816 KB Output is correct
45 Correct 17 ms 14240 KB Output is correct
46 Correct 18 ms 13988 KB Output is correct
47 Correct 10 ms 14124 KB Output is correct
48 Correct 12 ms 3676 KB Output is correct
49 Correct 14 ms 14228 KB Output is correct
50 Correct 16 ms 14172 KB Output is correct