oj.uz

답안 #153809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153809 2019-09-16T14:15:50 Z mhy908 JOI 문장 (JOI14_ho_t1) C++14
100 / 100
 138 ms 7288 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define llinf 8987654321987654321
#define inf 1987654321
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
int n, m;
char str[3010][3010];
char arr[10][10];
bool poss[3010][3010];
int ans, num;
char c[10]=" JOI";
int main()
{
    scanf("%d %d", &n, &m);
    for(int i=1; i<=n; i++)scanf("%s", str[i]+1);
    scanf("%s", arr[0]);
    scanf("%s", arr[1]);
    for(int i=1; i<n; i++){
        for(int j=1; j<m; j++){
            poss[i][j]=true;
            for(int k=0; k<=1; k++)
                for(int l=0; l<=1; l++)
                    if(str[i+k][j+l]!=arr[k][l])poss[i][j]=false;
            if(poss[i][j])num++;
        }
    }
    ans=num;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            int temp=num;
            for(int k=i; k>=i-1&&k>=1; k--)
                for(int l=j; l>=j-1&&l>=1; l--)
                    if(poss[k][l])temp--;
            for(int z=1; z<=3; z++){
                char t=str[i][j];
                int tempp=temp;
                str[i][j]=c[z];
                for(int k=i; k>=i-1&&k>=1; k--)
                    for(int l=j; l>=j-1&&l>=1; l--){
                        bool flag=true;
                        for(int a=0; a<=1; a++)
                            for(int b=0; b<=1; b++)
                                if(str[k+a][l+b]!=arr[a][b])flag=false;
                        if(flag)tempp++;
                    }
                ans=max(ans, tempp);
                str[i][j]=t;
            }
        }
    }
    printf("%d", ans);
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:20:10: 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:21:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1; i<=n; i++)scanf("%s", str[i]+1);
                            ~~~~~^~~~~~~~~~~~~~~~
2014_ho_t1.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", arr[0]);
     ~~~~~^~~~~~~~~~~~~~
2014_ho_t1.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", arr[1]);
     ~~~~~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 376 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 376 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 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 680 KB Output is correct
20 Correct 3 ms 632 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 3 ms 632 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 376 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 376 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 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 680 KB Output is correct
20 Correct 3 ms 632 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 888 KB Output is correct
31 Correct 4 ms 888 KB Output is correct
32 Correct 4 ms 888 KB Output is correct
33 Correct 4 ms 888 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 4 ms 924 KB Output is correct
37 Correct 6 ms 1528 KB Output is correct
38 Correct 6 ms 1528 KB Output is correct
39 Correct 11 ms 1528 KB Output is correct
40 Correct 9 ms 1528 KB Output is correct
41 Correct 91 ms 7160 KB Output is correct
42 Correct 136 ms 7288 KB Output is correct
43 Correct 137 ms 7244 KB Output is correct
44 Correct 105 ms 7248 KB Output is correct
45 Correct 123 ms 7236 KB Output is correct
46 Correct 135 ms 7288 KB Output is correct
47 Correct 68 ms 7160 KB Output is correct
48 Correct 138 ms 7160 KB Output is correct
49 Correct 121 ms 7288 KB Output is correct
50 Correct 132 ms 7260 KB Output is correct