Submission #917921

# Submission time Handle Problem Language Result Execution time Memory
917921 2024-01-29T05:31:59 Z SeDunion Bomb (IZhO17_bomb) C++17
92 / 100
232 ms 62060 KB
    #include<bits/stdc++.h>
    using namespace std;
    const int inf = 1000000000;
    char c1[2505][2505],c2[2505][2505];
    int n,m,l,r,bolo;
    int lf[2505][2505],rg[2505][ 2505],zr[2505];
    pair<int, int> ans;
     
    int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i) scanf("%s", &c1[i][1]);
    for(int i=0;i<2505;++i) zr[i] = inf;
     
    for(int i=0;i<2;++i) {
        memset((lf), 0, sizeof(lf));
        memset((rg), 0, sizeof(rg));
    for(int i=1;i<=n;++i){
      for(int j=1;j<=m;++j)
        if(c1[i][j] == '1') lf[i][j] = lf[i][j-1] + 1;
      for(int j=m;j>=1;--j)
        if(c1[i][j] == '1') rg[i][j] = rg[i][j+1] + 1;
      //for(int j=1;j<=m;++j)
     //   if(c1[i][j] == '1' && c1[i][j+1] != '1') zr[1] = min(zr[1], lf[i][j]);
        }
     
        for(int j=1;j<=m;++j)
        for(int i=0;i<=n+1;++i)
            if(c1[i][j] == '1') {
            l = min(l, lf[i][j]);  r = min(r, rg[i][j]);
            zr[i - bolo] = min(zr[i - bolo], l + r - 1);
            } else {
            if(i && bolo != i-1) zr[i - bolo] = 0;
            l = inf; r = inf;  bolo = i;
            }
     for(int i=1;i<=n;++i)
            for(int j=1;j<=m;++j)
                c2[i][j] = c1[n+1-i][j];
     for(int i=1;i<=n;++i)
            for(int j=1;j<=m;++j)
                 c1[i][j] = c2[i][j];
    }
    int b = inf;
     
    for(int a=1;a<=2504;++a) {
      b = min(b, zr[a]);
      ans = max(ans, {a*b, b});
    }
     
    cout << ans.first<< endl;
    }

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
bomb.cpp:11:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for(int i=1;i<=n;++i) scanf("%s", &c1[i][1]);
      |                           ~~~~~^~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 15 ms 51800 KB Output is correct
2 Correct 14 ms 51804 KB Output is correct
3 Correct 16 ms 61788 KB Output is correct
4 Correct 16 ms 61812 KB Output is correct
5 Correct 14 ms 51804 KB Output is correct
6 Correct 13 ms 51708 KB Output is correct
7 Incorrect 14 ms 51800 KB Output isn't correct
8 Correct 15 ms 51800 KB Output is correct
9 Correct 14 ms 51804 KB Output is correct
10 Correct 14 ms 51804 KB Output is correct
11 Correct 14 ms 51696 KB Output is correct
12 Correct 14 ms 51804 KB Output is correct
13 Correct 14 ms 51804 KB Output is correct
14 Correct 14 ms 51804 KB Output is correct
15 Correct 14 ms 51924 KB Output is correct
16 Correct 14 ms 51804 KB Output is correct
17 Correct 14 ms 51804 KB Output is correct
18 Correct 14 ms 51808 KB Output is correct
19 Correct 15 ms 51804 KB Output is correct
20 Correct 14 ms 51804 KB Output is correct
21 Correct 15 ms 51920 KB Output is correct
22 Correct 15 ms 51804 KB Output is correct
23 Correct 14 ms 51804 KB Output is correct
24 Correct 14 ms 52056 KB Output is correct
25 Correct 14 ms 51888 KB Output is correct
26 Incorrect 14 ms 51800 KB Output isn't correct
27 Incorrect 17 ms 55896 KB Output isn't correct
28 Correct 17 ms 55896 KB Output is correct
29 Correct 17 ms 55896 KB Output is correct
30 Correct 17 ms 55900 KB Output is correct
31 Correct 18 ms 56028 KB Output is correct
32 Correct 17 ms 55896 KB Output is correct
33 Correct 19 ms 55900 KB Output is correct
34 Correct 15 ms 56016 KB Output is correct
35 Correct 17 ms 55900 KB Output is correct
36 Incorrect 18 ms 56008 KB Output isn't correct
37 Correct 14 ms 51804 KB Output is correct
38 Correct 213 ms 61780 KB Output is correct
39 Correct 16 ms 51800 KB Output is correct
40 Correct 34 ms 55892 KB Output is correct
41 Correct 14 ms 51804 KB Output is correct
42 Correct 14 ms 51804 KB Output is correct
43 Correct 175 ms 61808 KB Output is correct
44 Correct 18 ms 55900 KB Output is correct
45 Correct 158 ms 61804 KB Output is correct
46 Correct 201 ms 61812 KB Output is correct
47 Correct 160 ms 61808 KB Output is correct
48 Correct 166 ms 61820 KB Output is correct
49 Incorrect 218 ms 62028 KB Output isn't correct
50 Correct 163 ms 61820 KB Output is correct
51 Correct 164 ms 61776 KB Output is correct
52 Correct 154 ms 61776 KB Output is correct
53 Correct 161 ms 61776 KB Output is correct
54 Correct 121 ms 61812 KB Output is correct
55 Correct 112 ms 61808 KB Output is correct
56 Correct 197 ms 61812 KB Output is correct
57 Correct 110 ms 61780 KB Output is correct
58 Correct 114 ms 61780 KB Output is correct
59 Correct 105 ms 61804 KB Output is correct
60 Correct 153 ms 61816 KB Output is correct
61 Incorrect 216 ms 61812 KB Output isn't correct
62 Incorrect 232 ms 62036 KB Output isn't correct
63 Incorrect 216 ms 62060 KB Output isn't correct
64 Correct 110 ms 61776 KB Output is correct
65 Correct 148 ms 61772 KB Output is correct
66 Correct 144 ms 61776 KB Output is correct
67 Correct 167 ms 61812 KB Output is correct
68 Correct 172 ms 61820 KB Output is correct
69 Correct 118 ms 61812 KB Output is correct
70 Correct 53 ms 60604 KB Output is correct
71 Correct 95 ms 61804 KB Output is correct
72 Correct 113 ms 61804 KB Output is correct
73 Correct 112 ms 61808 KB Output is correct
74 Correct 104 ms 61812 KB Output is correct
75 Correct 122 ms 61772 KB Output is correct
76 Correct 110 ms 61808 KB Output is correct
77 Correct 113 ms 61776 KB Output is correct
78 Correct 117 ms 61808 KB Output is correct
79 Correct 68 ms 61752 KB Output is correct
80 Correct 63 ms 61776 KB Output is correct
81 Correct 66 ms 61816 KB Output is correct
82 Correct 115 ms 61776 KB Output is correct
83 Correct 126 ms 61816 KB Output is correct
84 Correct 66 ms 61804 KB Output is correct
85 Correct 129 ms 61636 KB Output is correct
86 Correct 211 ms 62040 KB Output is correct
87 Correct 115 ms 61808 KB Output is correct
88 Correct 133 ms 61780 KB Output is correct
89 Correct 140 ms 61816 KB Output is correct
90 Correct 75 ms 60756 KB Output is correct
91 Correct 123 ms 61780 KB Output is correct
92 Correct 141 ms 61816 KB Output is correct
93 Correct 194 ms 61776 KB Output is correct
94 Correct 143 ms 61820 KB Output is correct
95 Correct 113 ms 61780 KB Output is correct
96 Correct 116 ms 61808 KB Output is correct
97 Correct 199 ms 62032 KB Output is correct
98 Correct 119 ms 61812 KB Output is correct
99 Correct 139 ms 61780 KB Output is correct
100 Correct 190 ms 61796 KB Output is correct