oj.uz

Submission #920197

# Submission time Handle Problem Language Result Execution time Memory
920197 2024-02-02T08:55:06 Z MilosMilutinovic Bomb (IZhO17_bomb) C++14
2 / 100
 1000 ms 600 KB 
// Online C++ compiler to run C++ program online
#include<bits/stdc++.h>

using namespace std;

int n,m;
char s[25][25];
bool was[25][25];

bool check(int x,int y){
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            was[i][j]=false;
        }
    }
    for(int i=0;i+x<=n;i++){
        for(int j=0;j+y<=m;j++){
            bool ok=true;
            for(int a=i;a<i+x;a++){
                for(int b=j;b<j+y;b++){
                    if(s[a][b]=='0') ok=false;
                }
            }
            if(ok){
                for(int a=i;a<i+x;a++){
                    for(int b=j;b<j+y;b++){
                        was[a][b]=true;
                    }
                }   
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(s[i][j]=='1'&&!was[i][j]){
                return false;
            }
        }
    }
    return true;
}

int main(){
    scanf("%d%d",&n,&m);
    if(n>20){
        printf("0\n");
        return 0;
    }
    for(int i=0;i<n;i++) scanf("%s",s[i]);
    int lx=n;
    int ly=m;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(s[i][j]=='0') continue;
            int ptr=j;
            while(ptr+1<m&&s[i][ptr+1]=='1') ptr++;
            ly=min(ly,ptr-j+1);
            ptr=j;
        }
    }
    for(int j=0;j<m;j++){
        for(int i=0;i<n;i++){
            if(s[i][j]=='0') continue;
            int ptr=i;
            while(ptr+1<n&&s[ptr+1][j]=='1') ptr++;
            lx=min(lx,ptr-i+1);
            i=ptr;
        }
    }
    int ans=0;
    for(int x=1;x<=lx;x++){
        for(int y=1;y<=ly;y++){
            if(check(x,y)) ans=max(ans,x*y);
        }
    }
    printf("%d\n",ans);
    return 0;
}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
bomb.cpp:49:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     for(int i=0;i<n;i++) scanf("%s",s[i]);
      |                          ~~~~~^~~~~~~~~~~

Subtask #1
2.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Execution timed out 1060 ms 348 KB Time limit exceeded
6 Execution timed out 1039 ms 344 KB Time limit exceeded
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Correct 0 ms 344 KB Output is correct
13 Incorrect 0 ms 344 KB Output isn't correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Incorrect 0 ms 344 KB Output isn't correct
16 Incorrect 1 ms 344 KB Output isn't correct
17 Incorrect 0 ms 344 KB Output isn't correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 0 ms 344 KB Output isn't correct
20 Incorrect 0 ms 344 KB Output isn't correct
21 Incorrect 0 ms 344 KB Output isn't correct
22 Incorrect 0 ms 344 KB Output isn't correct
23 Incorrect 1 ms 344 KB Output isn't correct
24 Incorrect 0 ms 344 KB Output isn't correct
25 Incorrect 1 ms 348 KB Output isn't correct
26 Incorrect 0 ms 348 KB Output isn't correct
27 Incorrect 0 ms 344 KB Output isn't correct
28 Incorrect 0 ms 348 KB Output isn't correct
29 Incorrect 0 ms 348 KB Output isn't correct
30 Incorrect 1 ms 344 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Incorrect 1 ms 344 KB Output isn't correct
33 Incorrect 1 ms 348 KB Output isn't correct
34 Incorrect 0 ms 344 KB Output isn't correct
35 Incorrect 1 ms 344 KB Output isn't correct
36 Incorrect 0 ms 348 KB Output isn't correct
37 Incorrect 0 ms 344 KB Output isn't correct
38 Incorrect 0 ms 348 KB Output isn't correct
39 Incorrect 0 ms 344 KB Output isn't correct
40 Incorrect 1 ms 348 KB Output isn't correct
41 Incorrect 1 ms 344 KB Output isn't correct
42 Incorrect 0 ms 348 KB Output isn't correct
43 Incorrect 0 ms 344 KB Output isn't correct
44 Incorrect 0 ms 348 KB Output isn't correct
45 Incorrect 0 ms 344 KB Output isn't correct
46 Incorrect 0 ms 348 KB Output isn't correct
47 Incorrect 0 ms 344 KB Output isn't correct
48 Incorrect 0 ms 600 KB Output isn't correct
49 Incorrect 0 ms 344 KB Output isn't correct
50 Incorrect 0 ms 344 KB Output isn't correct
51 Incorrect 0 ms 344 KB Output isn't correct
52 Incorrect 0 ms 344 KB Output isn't correct
53 Incorrect 0 ms 344 KB Output isn't correct
54 Incorrect 0 ms 344 KB Output isn't correct
55 Incorrect 1 ms 344 KB Output isn't correct
56 Incorrect 0 ms 344 KB Output isn't correct
57 Incorrect 0 ms 344 KB Output isn't correct
58 Incorrect 0 ms 344 KB Output isn't correct
59 Incorrect 1 ms 344 KB Output isn't correct
60 Incorrect 0 ms 348 KB Output isn't correct
61 Incorrect 0 ms 344 KB Output isn't correct
62 Incorrect 0 ms 344 KB Output isn't correct
63 Incorrect 1 ms 344 KB Output isn't correct
64 Incorrect 0 ms 344 KB Output isn't correct
65 Incorrect 0 ms 348 KB Output isn't correct
66 Incorrect 0 ms 344 KB Output isn't correct
67 Incorrect 0 ms 344 KB Output isn't correct
68 Incorrect 0 ms 348 KB Output isn't correct
69 Incorrect 1 ms 348 KB Output isn't correct
70 Incorrect 0 ms 344 KB Output isn't correct
71 Incorrect 0 ms 344 KB Output isn't correct
72 Incorrect 0 ms 344 KB Output isn't correct
73 Incorrect 1 ms 344 KB Output isn't correct
74 Incorrect 0 ms 344 KB Output isn't correct
75 Incorrect 0 ms 344 KB Output isn't correct
76 Incorrect 0 ms 348 KB Output isn't correct
77 Incorrect 0 ms 344 KB Output isn't correct
78 Incorrect 0 ms 344 KB Output isn't correct
79 Incorrect 0 ms 344 KB Output isn't correct
80 Incorrect 0 ms 344 KB Output isn't correct
81 Incorrect 0 ms 348 KB Output isn't correct
82 Incorrect 0 ms 512 KB Output isn't correct
83 Incorrect 0 ms 344 KB Output isn't correct
84 Incorrect 0 ms 344 KB Output isn't correct
85 Incorrect 0 ms 548 KB Output isn't correct
86 Incorrect 0 ms 348 KB Output isn't correct
87 Incorrect 0 ms 348 KB Output isn't correct
88 Incorrect 0 ms 348 KB Output isn't correct
89 Incorrect 0 ms 344 KB Output isn't correct
90 Incorrect 0 ms 344 KB Output isn't correct
91 Incorrect 0 ms 348 KB Output isn't correct
92 Incorrect 1 ms 344 KB Output isn't correct
93 Incorrect 1 ms 600 KB Output isn't correct
94 Incorrect 0 ms 344 KB Output isn't correct
95 Incorrect 0 ms 344 KB Output isn't correct
96 Incorrect 0 ms 344 KB Output isn't correct
97 Incorrect 0 ms 344 KB Output isn't correct
98 Incorrect 1 ms 348 KB Output isn't correct
99 Incorrect 1 ms 344 KB Output isn't correct
100 Incorrect 0 ms 348 KB Output isn't correct