oj.uz

답안 #55169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
55169 2018-07-06T08:08:25 Z Costin Andrei Oncescu(#1304) JOI 문장 (JOI14_ho_t1) C++11
100 / 100
 90 ms 2708 KB 
#include<bits/stdc++.h>

using namespace std;

int N, M, initS;
bool init[1009][1009];
char sir[1009][1009], pattern[4][4];
vector < char > possibleCharacters = {'J', 'O', 'I'};

bool check (int i, int j)
{
    for (int k=0; k<2; k++)
        for (int p=0; p<2; p++)
            if (sir[i + k][j + p] != pattern[k][p])
                return 0;
    return 1;
}

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d %d\n", &N, &M);
for (int i=1; i<=N; i++)
    scanf ("%s\n", sir[i] + 1);
for (int i=0; i<2; i++)
    scanf ("%s\n", pattern[i]);
for (int i=1; i<N; i++)
    for (int j=1; j<M; j++)
        init[i][j] = check (i, j),
        initS += init[i][j];
int ans = initS;
for (int i=1; i<=N; i++)
    for (int j=1; j<=M; j++)
        for (auto c : possibleCharacters)
            if (c != sir[i][j])
            {
                int curr = initS;
                for (int k=max (i - 1, 1); k<=i; k++)
                    for (int p=max (j - 1, 1); p<=j; p++)
                        curr -= init[k][p];
                char old = sir[i][j];
                sir[i][j] = c;
                for (int k=max (i - 1, 1); k<=i; k++)
                    for (int p=max (j - 1, 1); p<=j; p++)
                        curr += check (k, p);
                sir[i][j] = old;
                if (curr > ans)
                    ans = curr;
            }
printf ("%d\n", ans);
return 0;
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf ("%d %d\n", &N, &M);
 ~~~~~~^~~~~~~~~~~~~~~~~~~
2014_ho_t1.cpp:26:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%s\n", sir[i] + 1);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~
2014_ho_t1.cpp:28:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%s\n", pattern[i]);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 3 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 488 KB Output is correct
10 Correct 2 ms 520 KB Output is correct
11 Correct 2 ms 520 KB Output is correct
12 Correct 2 ms 520 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 620 KB Output is correct
16 Correct 2 ms 660 KB Output is correct
17 Correct 2 ms 660 KB Output is correct
18 Correct 3 ms 660 KB Output is correct
19 Correct 3 ms 660 KB Output is correct
20 Correct 2 ms 660 KB Output is correct
21 Correct 2 ms 660 KB Output is correct
22 Correct 2 ms 660 KB Output is correct
23 Correct 2 ms 660 KB Output is correct
24 Correct 2 ms 660 KB Output is correct
25 Correct 2 ms 660 KB Output is correct
26 Correct 2 ms 660 KB Output is correct
27 Correct 2 ms 660 KB Output is correct
28 Correct 3 ms 676 KB Output is correct
29 Correct 2 ms 676 KB Output is correct
30 Correct 3 ms 804 KB Output is correct
31 Correct 3 ms 804 KB Output is correct
32 Correct 3 ms 804 KB Output is correct
33 Correct 3 ms 804 KB Output is correct
34 Correct 2 ms 804 KB Output is correct
35 Correct 2 ms 804 KB Output is correct
36 Correct 3 ms 804 KB Output is correct
37 Correct 5 ms 1020 KB Output is correct
38 Correct 4 ms 1024 KB Output is correct
39 Correct 6 ms 1024 KB Output is correct
40 Correct 5 ms 1024 KB Output is correct
41 Correct 66 ms 2684 KB Output is correct
42 Correct 74 ms 2684 KB Output is correct
43 Correct 83 ms 2684 KB Output is correct
44 Correct 66 ms 2684 KB Output is correct
45 Correct 81 ms 2708 KB Output is correct
46 Correct 77 ms 2708 KB Output is correct
47 Correct 54 ms 2708 KB Output is correct
48 Correct 68 ms 2708 KB Output is correct
49 Correct 90 ms 2708 KB Output is correct
50 Correct 82 ms 2708 KB Output is correct