Submission #833527

# Submission time Handle Problem Language Result Execution time Memory
833527 2023-08-22T06:31:26 Z vjudge1 Bomb (IZhO17_bomb) C++17
24 / 100
39 ms 16092 KB
#include<bits/stdc++.h>
using namespace std;
 
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
const int mod = 1e9 + 7;
const int maxn = 2505;

int n, m;
char grid[maxn][maxn];

void solve(){
    if(n == 1 || m == 1){
        if(n == 1){
            //vector<int> cnt;
            int i = 1;
            int mini = LLONG_MAX;
            for(; i <= m; i++){
                int tmp;
                if(grid[1][i] == '1'){
                    tmp = 1;
                    while(grid[1][i + 1] == '1'){
                        tmp++;
                        i++;
                    }
                }else{
                    continue;
                }
                //cnt.pb(tmp);
                mini = min(mini, tmp);
            }
            cout << mini << endl;
        }else{
            int i = 1;
            int mini = LLONG_MAX;
            for(; i <= n; i++){
                int tmp;
                if(grid[i][1] == '1'){
                    tmp = 1;
                    while(grid[i + 1][1] == '1'){
                        tmp++;
                        i++;
                    }
                }else{
                    continue;
                }
                //cnt.pb(tmp);
                mini = min(mini, tmp);
            }
            cout << mini << endl;
        }
        return;
    }else{
        //cek tiap baris
        int minsbaris = LLONG_MAX;
        for(int i = 1; i <= n; i++){
            int j = 1;
            int mini = LLONG_MAX;
            for(; j <= m; j++){
                int tmp;
                if(grid[i][j] == '1'){
                    tmp = 1;
                    while(grid[i][j + 1] == '1'){
                        tmp++;
                        j++;
                    }
                }else{
                    continue;
                }
                mini = min(mini, tmp);
            }
            minsbaris = min(minsbaris, mini);
        }

        //cek tiap kolom
        int minkolom = LLONG_MAX;
        for(int i = 1; i <= m; i++){
            int j = 1;
            int mini = LLONG_MAX;
            for(; j <= n; j++){
                int tmp;
                if(grid[j][i] == '1'){
                    tmp = 1;
                    while(grid[j + 1][i] == '1'){
                        tmp++;
                        j++;
                    }
                }else{
                    continue;
                }
                mini = min(mini, tmp);
            }
            minkolom = min(minkolom, mini);
        }

        //cout << "minsbaris = " << minsbaris << " minkolom = " << minkolom << endl;
        cout << minkolom * minsbaris << endl;
    }
}
 
int32_t main()
{
    IOS
    cin >> n >> m;
    string s[n + 1];
    for(int i = 1; i <= n; i++){
        cin >> s[i];
    }

    
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            grid[i][j] = s[i][j - 1];
        }
    }

    solve();
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 6484 KB Output is correct
4 Correct 2 ms 6484 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Incorrect 0 ms 340 KB Output isn't correct
11 Incorrect 0 ms 340 KB Output isn't correct
12 Incorrect 0 ms 340 KB Output isn't correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Incorrect 0 ms 340 KB Output isn't correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Incorrect 0 ms 468 KB Output isn't correct
19 Incorrect 0 ms 468 KB Output isn't correct
20 Incorrect 0 ms 468 KB Output isn't correct
21 Incorrect 1 ms 340 KB Output isn't correct
22 Incorrect 1 ms 468 KB Output isn't correct
23 Incorrect 0 ms 468 KB Output isn't correct
24 Incorrect 0 ms 468 KB Output isn't correct
25 Incorrect 0 ms 468 KB Output isn't correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Incorrect 2 ms 1108 KB Output isn't correct
29 Incorrect 1 ms 1364 KB Output isn't correct
30 Incorrect 2 ms 1620 KB Output isn't correct
31 Incorrect 1 ms 1232 KB Output isn't correct
32 Incorrect 1 ms 1492 KB Output isn't correct
33 Incorrect 2 ms 1620 KB Output isn't correct
34 Incorrect 1 ms 1236 KB Output isn't correct
35 Incorrect 2 ms 1620 KB Output isn't correct
36 Correct 3 ms 1736 KB Output is correct
37 Incorrect 1 ms 340 KB Output isn't correct
38 Correct 27 ms 15932 KB Output is correct
39 Incorrect 0 ms 340 KB Output isn't correct
40 Incorrect 4 ms 3924 KB Output isn't correct
41 Incorrect 0 ms 340 KB Output isn't correct
42 Incorrect 0 ms 592 KB Output isn't correct
43 Correct 31 ms 15844 KB Output is correct
44 Incorrect 2 ms 1620 KB Output isn't correct
45 Incorrect 28 ms 15812 KB Output isn't correct
46 Correct 30 ms 15788 KB Output is correct
47 Incorrect 28 ms 15732 KB Output isn't correct
48 Incorrect 27 ms 15820 KB Output isn't correct
49 Correct 27 ms 15888 KB Output is correct
50 Incorrect 26 ms 15752 KB Output isn't correct
51 Incorrect 27 ms 15760 KB Output isn't correct
52 Incorrect 29 ms 15944 KB Output isn't correct
53 Incorrect 27 ms 15844 KB Output isn't correct
54 Incorrect 27 ms 15844 KB Output isn't correct
55 Incorrect 29 ms 15940 KB Output isn't correct
56 Correct 26 ms 15872 KB Output is correct
57 Incorrect 28 ms 15972 KB Output isn't correct
58 Incorrect 39 ms 16092 KB Output isn't correct
59 Incorrect 29 ms 15948 KB Output isn't correct
60 Correct 27 ms 15848 KB Output is correct
61 Correct 27 ms 15736 KB Output is correct
62 Correct 25 ms 15748 KB Output is correct
63 Correct 25 ms 15724 KB Output is correct
64 Correct 30 ms 15880 KB Output is correct
65 Incorrect 26 ms 15832 KB Output isn't correct
66 Incorrect 26 ms 15836 KB Output isn't correct
67 Incorrect 26 ms 15796 KB Output isn't correct
68 Incorrect 26 ms 15692 KB Output isn't correct
69 Incorrect 31 ms 15824 KB Output isn't correct
70 Incorrect 17 ms 12104 KB Output isn't correct
71 Incorrect 26 ms 15512 KB Output isn't correct
72 Incorrect 26 ms 15564 KB Output isn't correct
73 Incorrect 26 ms 15496 KB Output isn't correct
74 Incorrect 34 ms 15572 KB Output isn't correct
75 Incorrect 27 ms 15588 KB Output isn't correct
76 Incorrect 27 ms 15396 KB Output isn't correct
77 Incorrect 28 ms 15180 KB Output isn't correct
78 Incorrect 29 ms 15008 KB Output isn't correct
79 Incorrect 26 ms 14944 KB Output isn't correct
80 Incorrect 26 ms 14728 KB Output isn't correct
81 Incorrect 32 ms 14580 KB Output isn't correct
82 Incorrect 30 ms 14444 KB Output isn't correct
83 Incorrect 26 ms 14540 KB Output isn't correct
84 Incorrect 27 ms 14536 KB Output isn't correct
85 Incorrect 27 ms 14580 KB Output isn't correct
86 Incorrect 25 ms 14540 KB Output isn't correct
87 Incorrect 26 ms 14544 KB Output isn't correct
88 Incorrect 27 ms 14488 KB Output isn't correct
89 Incorrect 26 ms 14284 KB Output isn't correct
90 Incorrect 17 ms 10572 KB Output isn't correct
91 Incorrect 26 ms 14052 KB Output isn't correct
92 Incorrect 29 ms 14052 KB Output isn't correct
93 Incorrect 23 ms 13772 KB Output isn't correct
94 Incorrect 26 ms 13648 KB Output isn't correct
95 Incorrect 25 ms 13388 KB Output isn't correct
96 Incorrect 25 ms 13260 KB Output isn't correct
97 Incorrect 24 ms 13268 KB Output isn't correct
98 Incorrect 24 ms 13268 KB Output isn't correct
99 Incorrect 25 ms 13268 KB Output isn't correct
100 Incorrect 24 ms 13140 KB Output isn't correct