oj.uz

Submission #877330

# Submission time Handle Problem Language Result Execution time Memory
877330 2023-11-23T06:38:39 Z _unknown_2010 Bomb (IZhO17_bomb) C++17
24 / 100
 94 ms 6744 KB 
//#ifndef LOCAL
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#endif

#include <bits/stdc++.h>
using namespace std;
using vecp = vector<pair<int,int>>;
#define vecm(a,n,m) vector<vector<int>>a(n,vector<int>(m,0));
#define int int64_t
#define pb  push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mpii map<int,int>
#define lb lower_bound
#define ub upper_bound
#define foor(i,a,b) for(int i=a;i<b; i++)
#define foor(i,a) foor(i,0,a)
#define ins insert
#define ss second
#define ff first
#define until(x, a) for (auto x : a)
#define ln(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define seea(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define seev(v,n) for(int i=0;i<n;i++){int x; cin>>x; v.push_back(x);}
const int mod = 1E9+7;
void solution(){
    int n,m;
    cin >> n >> m;
    vector<vector<char>> vec(n,vector<char>(m));
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            cin >> vec[i][j];
        }
    }
    int a=0,b=0,cnt=0,mn=INT_MAX;
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            if(vec[i][j]=='1')cnt++;
            else {
                if(cnt>0)mn=min(mn,cnt);
                cnt=0;
            }
        }
        if(cnt>0){
            mn=min(mn,cnt);
            cnt=0;
        }
    }
    a=mn;
    mn=INT_MAX;
    cnt=0;
    for(int i=0; i<m; i++){
        for(int j=0; j<n; j++){
            if(vec[j][i]=='1')cnt++;
            else {
                if(cnt>0)mn=min(mn,cnt);
                cnt=0;
            }
        }
        if(cnt>0){
            mn=min(mn,cnt);
            cnt=0;
        }
    }
    b=mn;
    if(a==INT_MAX){
        cout << 0;
    }
    else {
        cout << a*b;
    }
}
int32_t main(){
    clock_t tStart = clock();
    std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int q = 1; // cin >> q;
    while(q--) {
        solution();
        cout << '\n';
    }
}
/*

██╗  ██╗ █████╗  ██████╗     ██╗██╗   ██╗ ██████╗████████╗
██║░░██║██╔══██╗██╔════╝░░░░░██║██║░░░██║██╔════╝╚══██╔══╝
███████║██║░░██║╚█████╗░░░░░░██║██║░░░██║╚█████╗░░░░██║░░░
██╔══██║██║░░██║░╚═══██╗██╗░░██║██║░░░██║░╚═══██╗░░░██║░░░
██║░░██║╚█████╔╝██████╔╝╚█████╔╝╚██████╔╝██████╔╝░░░██║░░░
╚═╝░░╚═╝░╚════╝░╚═════╝░░╚════╝░░╚═════╝░╚═════╝░░░░╚═╝░░░
*/

Compilation message

bomb.cpp:19: warning: "foor" redefined
   19 | #define foor(i,a) foor(i,0,a)
      | 
bomb.cpp:18: note: this is the location of the previous definition
   18 | #define foor(i,a,b) for(int i=a;i<b; i++)
      | 
bomb.cpp: In function 'int32_t main()':
bomb.cpp:77:13: warning: unused variable 'tStart' [-Wunused-variable]
   77 |     clock_t tStart = clock();
      |             ^~~~~~

Subtask #1
24.0 / 100.0

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