oj.uz

답안 #51755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
51755 2018-06-21T03:21:55 Z model_code JOI 문장 (JOI14_ho_t1) C++17
100 / 100
 140 ms 1660 KB 
#include <cstdio>

int M,N;
char flags[1002][1002];
char symbols[5][5];

int main() {
	scanf("%d%d",&M,&N);
	for(int i=0;i<M;i++) scanf("%s",flags[i]);
	for(int i=0;i<2;i++) scanf("%s",symbols[i]);
	int defsol=0;
	for(int i=0;i<M-1;i++) {
		for(int j=0;j<N-1;j++) {
			int exists=1;
			for(int x=0;x<2;x++) {
				for(int y=0;y<2;y++) {
					if(flags[i+x][j+y]!=symbols[x][y]) exists=0;
				}
			}
			defsol+=exists;
		}
	}
	int changemax=0;
	for(int i=0;i<M;i++) {
		for(int j=0;j<N;j++) {
			char def=flags[i][j];
			int deleted_emblems=0;
			int addmax=0;
			for(int x=-1;x<=0;x++) {
				for(int y=-1;y<=0;y++) {
					if(i+x>=0&&i+x+1<M) {
						if(j+y>=0&&j+y+1<N) {
							int exists=1;
							for(int v=0;v<2;v++) {
								for(int w=0;w<2;w++) {
									if(flags[i+x+v][j+y+w]!=symbols[v][w]) exists=0;
								}
							}
							deleted_emblems+=exists;
						}
					}
				}
			}
			for(int types=0;types<3;types++) {
				if(types==0) flags[i][j]='J';
				if(types==1) flags[i][j]='O';
				if(types==2) flags[i][j]='I';
				int addvl=0;
				for(int x=-1;x<=0;x++) {
					for(int y=-1;y<=0;y++) {
						if(i+x>=0&&i+x+1<M) {
							if(j+y>=0&&j+y+1<N) {
								int exists=1;
								for(int v=0;v<2;v++) {
									for(int w=0;w<2;w++) {
										if(flags[i+x+v][j+y+w]!=symbols[v][w]) exists=0;
									}
								}
								addvl+=exists;
							}
						}
					}
				}
				if(addmax<addvl) addmax=addvl;
			}
			if(changemax<addmax-deleted_emblems) changemax=addmax-deleted_emblems;
			flags[i][j]=def;
		}
	}
	printf("%d\n",changemax+defsol);
	return 0;
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&M,&N);
  ~~~~~^~~~~~~~~~~~~~
2014_ho_t1.cpp:9:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<M;i++) scanf("%s",flags[i]);
                       ~~~~~^~~~~~~~~~~~~~~
2014_ho_t1.cpp:10:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<2;i++) scanf("%s",symbols[i]);
                       ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 528 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 528 KB Output is correct
6 Correct 2 ms 528 KB Output is correct
7 Correct 2 ms 528 KB Output is correct
8 Correct 2 ms 528 KB Output is correct
9 Correct 2 ms 528 KB Output is correct
10 Correct 2 ms 528 KB Output is correct
11 Correct 2 ms 528 KB Output is correct
12 Correct 2 ms 528 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 2 ms 656 KB Output is correct
18 Correct 3 ms 656 KB Output is correct
19 Correct 2 ms 656 KB Output is correct
20 Correct 2 ms 656 KB Output is correct
21 Correct 2 ms 656 KB Output is correct
22 Correct 2 ms 656 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 528 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 528 KB Output is correct
6 Correct 2 ms 528 KB Output is correct
7 Correct 2 ms 528 KB Output is correct
8 Correct 2 ms 528 KB Output is correct
9 Correct 2 ms 528 KB Output is correct
10 Correct 2 ms 528 KB Output is correct
11 Correct 2 ms 528 KB Output is correct
12 Correct 2 ms 528 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 2 ms 656 KB Output is correct
18 Correct 3 ms 656 KB Output is correct
19 Correct 2 ms 656 KB Output is correct
20 Correct 2 ms 656 KB Output is correct
21 Correct 2 ms 656 KB Output is correct
22 Correct 2 ms 656 KB Output is correct
23 Correct 2 ms 656 KB Output is correct
24 Correct 2 ms 656 KB Output is correct
25 Correct 2 ms 656 KB Output is correct
26 Correct 2 ms 656 KB Output is correct
27 Correct 2 ms 656 KB Output is correct
28 Correct 2 ms 656 KB Output is correct
29 Correct 2 ms 656 KB Output is correct
30 Correct 3 ms 656 KB Output is correct
31 Correct 3 ms 656 KB Output is correct
32 Correct 3 ms 656 KB Output is correct
33 Correct 3 ms 688 KB Output is correct
34 Correct 2 ms 688 KB Output is correct
35 Correct 2 ms 688 KB Output is correct
36 Correct 3 ms 688 KB Output is correct
37 Correct 7 ms 764 KB Output is correct
38 Correct 10 ms 800 KB Output is correct
39 Correct 7 ms 800 KB Output is correct
40 Correct 7 ms 844 KB Output is correct
41 Correct 113 ms 1532 KB Output is correct
42 Correct 140 ms 1660 KB Output is correct
43 Correct 124 ms 1660 KB Output is correct
44 Correct 138 ms 1660 KB Output is correct
45 Correct 121 ms 1660 KB Output is correct
46 Correct 127 ms 1660 KB Output is correct
47 Correct 113 ms 1660 KB Output is correct
48 Correct 125 ms 1660 KB Output is correct
49 Correct 122 ms 1660 KB Output is correct
50 Correct 127 ms 1660 KB Output is correct