oj.uz

Submission #920206

# Submission time Handle Problem Language Result Execution time Memory
920206 2024-02-02T09:17:01 Z MilosMilutinovic Bomb (IZhO17_bomb) C++14
60 / 100
 1000 ms 55124 KB 
// Online C++ compiler to run C++ program online
#include<bits/stdc++.h>

using namespace std;

int n,m;
char s[2505];
int v[2505][2505],a[2505][2505];
bool was[2505][2505];

int queryA(int x1,int y1,int x2,int y2){
    return a[x2][y2]-a[x1-1][y2]-a[x2][y1-1]+a[x1-1][y1-1];
}

int queryV(int x1,int y1,int x2,int y2){
    return v[x2][y2]-v[x1-1][y2]-v[x2][y1-1]+v[x1-1][y1-1];
}

bool check(int x,int y){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            v[i][j]=0;
        }
    }
    for(int i=1;i+x<=n+1;i++){
        for(int j=1;j+y<=m+1;j++){
            if(queryA(i,j,i+x-1,j+y-1)==x*y){
                v[i][j]=1;
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            v[i][j]+=v[i-1][j];
            v[i][j]+=v[i][j-1];
            v[i][j]-=v[i-1][j-1];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(queryA(i,j,i,j)==1&&queryV(max(1,i-x+1),max(1,j-y+1),i,j)==0){
                return false;
            }
        }
    }
    return true;
}

int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%s",s+1);
        for(int j=1;j<=m;j++){
            a[i][j]=(int)(s[j]-'0');
            a[i][j]+=a[i-1][j];
            a[i][j]+=a[i][j-1];
            a[i][j]-=a[i-1][j-1];
        }
    }
    int lx=n;
    int ly=m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(queryA(i,j,i,j)==0) continue;
            int ptr=j;
            while(ptr+1<=m&&queryA(i,ptr+1,i,ptr+1)==1) ptr++;
            ly=min(ly,ptr-j+1);
            j=ptr;
        }
    }
    for(int j=1;j<=m;j++){ 
        for(int i=1;i<=n;i++){
            if(queryA(i,j,i,j)==0) continue;
            int ptr=i;
            while(ptr+1<=n&&queryA(ptr+1,j,ptr+1,j)==1) ptr++;
            lx=min(lx,ptr-i+1);
            i=ptr;
        }
    }
    int ans=0;
    for(int x=lx;x>=1;x--){
        int l=1,r=ly;
        while(l<=r){
            int mid=(l+r)/2;
            if(x*mid<=ans||check(x,mid)) ans=max(ans,x*mid),l=mid+1; else r=mid-1;
        }
    }
    printf("%d\n",ans);
    return 0;
}
/*
5 6
001000
111110
111110
111110
000100
*/

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
bomb.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         scanf("%s",s+1);
      |         ~~~~~^~~~~~~~~~

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 9 ms 50264 KB Output is correct
4 Correct 8 ms 50264 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 2 ms 8536 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 3 ms 8540 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 6 ms 8536 KB Output is correct
26 Correct 2 ms 8536 KB Output is correct
27 Correct 5 ms 13252 KB Output is correct
28 Correct 7 ms 12632 KB Output is correct
29 Correct 73 ms 12860 KB Output is correct
30 Correct 428 ms 12920 KB Output is correct
31 Correct 222 ms 12888 KB Output is correct
32 Correct 297 ms 13140 KB Output is correct
33 Correct 603 ms 17232 KB Output is correct
34 Correct 7 ms 12632 KB Output is correct
35 Correct 87 ms 17036 KB Output is correct
36 Correct 11 ms 16984 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 533 ms 54864 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Execution timed out 1045 ms 25432 KB Time limit exceeded
41 Correct 2 ms 4440 KB Output is correct
42 Correct 7 ms 8536 KB Output is correct
43 Correct 433 ms 54940 KB Output is correct
44 Correct 620 ms 17036 KB Output is correct
45 Execution timed out 1037 ms 54736 KB Time limit exceeded
46 Correct 251 ms 54864 KB Output is correct
47 Execution timed out 1041 ms 54864 KB Time limit exceeded
48 Correct 1000 ms 55084 KB Output is correct
49 Correct 198 ms 54864 KB Output is correct
50 Correct 703 ms 55124 KB Output is correct
51 Correct 800 ms 54864 KB Output is correct
52 Correct 848 ms 55120 KB Output is correct
53 Correct 914 ms 54936 KB Output is correct
54 Execution timed out 1027 ms 54864 KB Time limit exceeded
55 Execution timed out 1032 ms 54744 KB Time limit exceeded
56 Correct 295 ms 55120 KB Output is correct
57 Execution timed out 1040 ms 54864 KB Time limit exceeded
58 Execution timed out 1016 ms 54864 KB Time limit exceeded
59 Execution timed out 1035 ms 54864 KB Time limit exceeded
60 Correct 265 ms 55004 KB Output is correct
61 Correct 287 ms 54932 KB Output is correct
62 Correct 422 ms 54828 KB Output is correct
63 Correct 523 ms 55120 KB Output is correct
64 Correct 352 ms 54936 KB Output is correct
65 Execution timed out 1022 ms 54864 KB Time limit exceeded
66 Correct 438 ms 55120 KB Output is correct
67 Correct 628 ms 54968 KB Output is correct
68 Correct 540 ms 54936 KB Output is correct
69 Correct 669 ms 54780 KB Output is correct
70 Execution timed out 1028 ms 47952 KB Time limit exceeded
71 Execution timed out 1087 ms 54880 KB Time limit exceeded
72 Execution timed out 1016 ms 54840 KB Time limit exceeded
73 Execution timed out 1032 ms 54832 KB Time limit exceeded
74 Execution timed out 1028 ms 54740 KB Time limit exceeded
75 Execution timed out 1020 ms 54864 KB Time limit exceeded
76 Execution timed out 1012 ms 54840 KB Time limit exceeded
77 Execution timed out 1014 ms 54864 KB Time limit exceeded
78 Execution timed out 1045 ms 54996 KB Time limit exceeded
79 Execution timed out 1031 ms 54860 KB Time limit exceeded
80 Execution timed out 1036 ms 54864 KB Time limit exceeded
81 Execution timed out 1016 ms 54864 KB Time limit exceeded
82 Execution timed out 1018 ms 54840 KB Time limit exceeded
83 Execution timed out 1026 ms 54744 KB Time limit exceeded
84 Execution timed out 1028 ms 54744 KB Time limit exceeded
85 Execution timed out 1039 ms 54864 KB Time limit exceeded
86 Execution timed out 1031 ms 54864 KB Time limit exceeded
87 Execution timed out 1030 ms 54864 KB Time limit exceeded
88 Execution timed out 1016 ms 54832 KB Time limit exceeded
89 Execution timed out 1008 ms 55100 KB Time limit exceeded
90 Execution timed out 1014 ms 47952 KB Time limit exceeded
91 Execution timed out 1039 ms 54864 KB Time limit exceeded
92 Execution timed out 1022 ms 54864 KB Time limit exceeded
93 Execution timed out 1038 ms 54864 KB Time limit exceeded
94 Execution timed out 1012 ms 54864 KB Time limit exceeded
95 Execution timed out 1035 ms 54732 KB Time limit exceeded
96 Execution timed out 1032 ms 54868 KB Time limit exceeded
97 Execution timed out 1024 ms 54884 KB Time limit exceeded
98 Execution timed out 1047 ms 52696 KB Time limit exceeded
99 Execution timed out 1030 ms 51280 KB Time limit exceeded
100 Execution timed out 1049 ms 51136 KB Time limit exceeded