답안 #95320 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95320	2019-01-30T05:09:22 Z	Retro3014	JOI 문장 (JOI14_ho_t1)	C++17	100 / 100	77 ms	2324 KB

2014_ho_t1

#include <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>
 
#define MAX_N 1000
using namespace std;
 
int N, M;
 
char c[MAX_N+1][MAX_N+1];
char ch[2][2];
int sum;
int ans;
 
 
int differ(int x, int y){
	int ret=0;
	if(x>=N || y>=M)	return -1;
	for(int i=0; i<2; i++){
		for(int j=0; j<2; j++){
			if(c[x+i][y+j]!=ch[i][j])	ret++;
		}
	}
	return ret;
}
 
bool same(int x, int y){
	return (differ(x, y)==0);
}
 
 
 
int main(){
	scanf("%d%d", &N, &M);
	for(int i=0; i<N; i++){
		getchar();
		for(int j=0; j<M; j++){
			scanf("%c", &c[i][j]);
			//printf("%c", c[i][j]);
		}//cout<<endl;
	}
	for(int i=0; i<2; i++){
		getchar();
		for(int j=0; j<2; j++)	{
			scanf("%c", &ch[i][j]);
			//printf("%c", ch[i][j]);
		}//cout<<endl;
	}
	for(int i=0; i<N-1; i++){
		for(int j=0; j<M-1; j++){
			sum+=same(i, j);
		}
	}
	//cout<<sum<<endl;
	ans = max(ans, sum);
	int sum2;
	for(int i=0; i<N-1; i++){
		for(int j=0; j<M-1; j++){
			if(differ(i, j)!=1)	continue;
			sum2 = sum;
			int ii, jj;
			int pi, pj;
			//*
			for(ii=max(0, i-1); ii<min(N-1,i+2); ii++){
				for(jj=max(0, j-1); jj<min(M-1, j+2); jj++){
					sum2-=same(ii, jj);
				}
			}
			//*/
			char prv;
			for(ii=0; ii<2; ii++){
				for(jj=0; jj<2; jj++){
					if(c[i+ii][j+jj]!=ch[ii][jj]){
						prv = c[i+ii][j+jj];
						c[i+ii][j+jj] = ch[ii][jj];
						pi = ii; pj = jj;
						break;
					}
				}
			}
			//*
			for(ii=max(0, i-1); ii<min(N-1,i+2); ii++){
				for(jj=max(0, j-1); jj<min(M-1, j+2); jj++){
					//cout<<ii<<" "<<jj<<" "<<same(ii, jj)<<endl;
					sum2+=same(ii, jj);
				}
			}
			//printf("%d %d %d\n", i, j, sum2);
			//*/
			ans = max(ans, sum2);
			c[i+pi][j+pj] = prv;
		}
	}
 
	printf("%d", ans);
	return 0;
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:35: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:39:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c", &c[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~
2014_ho_t1.cpp:46:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c", &ch[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~
2014_ho_t1.cpp:92:18: warning: 'prv' may be used uninitialized in this function [-Wmaybe-uninitialized]
    c[i+pi][j+pj] = prv;
    ~~~~~~~~~~~~~~^~~~~
2014_ho_t1.cpp:92:13: warning: 'pj' may be used uninitialized in this function [-Wmaybe-uninitialized]
    c[i+pi][j+pj] = prv;
            ~^~~
2014_ho_t1.cpp:92:7: warning: 'pi' may be used uninitialized in this function [-Wmaybe-uninitialized]
    c[i+pi][j+pj] = prv;
      ~^~~

Subtask #1
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 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	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	9 ms	252 KB	Output is correct
25	Correct	2 ms	372 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	504 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	4 ms	504 KB	Output is correct
38	Correct	4 ms	504 KB	Output is correct
39	Correct	5 ms	508 KB	Output is correct
40	Correct	4 ms	504 KB	Output is correct
41	Correct	48 ms	2320 KB	Output is correct
42	Correct	75 ms	2296 KB	Output is correct
43	Correct	58 ms	2268 KB	Output is correct
44	Correct	49 ms	2296 KB	Output is correct
45	Correct	60 ms	2268 KB	Output is correct
46	Correct	75 ms	2324 KB	Output is correct
47	Correct	49 ms	2296 KB	Output is correct
48	Correct	49 ms	2296 KB	Output is correct
49	Correct	60 ms	2280 KB	Output is correct
50	Correct	77 ms	2300 KB	Output is correct

답안 #95320

Compilation message

Subtask #1 30.0 / 30.0

Subtask #2 70.0 / 70.0

Subtask #1
30.0 / 30.0

Subtask #2
70.0 / 70.0