# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
883693 |
2023-12-05T18:04:35 Z |
Sokol080808 |
Bomb (IZhO17_bomb) |
C++17 |
|
92 ms |
6892 KB |
#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <malloc.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& p) {in >> p.first >> p.second; return in;}
template<typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2>& p) {out << p.first << ' ' << p.second; return out;}
template<typename T> istream& operator>>(istream& in, vector<T>& v) {for (auto& x : v) in >> x; return in;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& v) {for (auto& x : v) out << x << ' '; return out;}
template<typename T> ostream& operator<<(ostream& out, set<T>& v) {for (auto& x : v) out << x << ' '; return out;}
template<typename T> ostream& operator<<(ostream& out, multiset<T>& v) {for (auto& x : v) out << x << ' '; return out;}
const int MAX_INT = 2147483647;
const double pi = acos(-1.0);
const int mod = 1e9 + 7;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<char>> f(n, vector<char>(m));
for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> f[i][j];
int mx_x = 1e9;
for (int i = 0; i < n; i++) {
int mn = 1e9;
int cur = 0;
for (int j = 0; j < m; j++) {
if (f[i][j] == '1') cur++;
if (f[i][j] == '0' || j + 1 == m) {
if (cur != 0) mn = min(mn, cur);
cur = 0;
}
}
mx_x = min(mx_x, mn);
}
int mx_y = 1e9;
for (int j = 0; j < m; j++) {
int mn = 1e9;
int cur = 0;
for (int i = 0; i < n; i++) {
if (f[i][j] == '1') cur++;
if (f[i][j] == '0' || i + 1 == n) {
if (cur != 0) mn = min(mn, cur);
cur = 0;
}
}
mx_y = min(mx_y, mn);
}
cout << min(1LL * n * m, 1LL * mx_x * mx_y) << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 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 |
348 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 |
1 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 |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
344 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 |
1 ms |
348 KB |
Output isn't correct |
21 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
22 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
23 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
24 |
Incorrect |
1 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 |
2 ms |
580 KB |
Output isn't correct |
29 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
30 |
Incorrect |
3 ms |
604 KB |
Output isn't correct |
31 |
Incorrect |
2 ms |
856 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
600 KB |
Output isn't correct |
33 |
Incorrect |
2 ms |
680 KB |
Output isn't correct |
34 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
35 |
Incorrect |
3 ms |
628 KB |
Output isn't correct |
36 |
Correct |
3 ms |
604 KB |
Output is correct |
37 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
38 |
Correct |
82 ms |
6492 KB |
Output is correct |
39 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
40 |
Incorrect |
8 ms |
1116 KB |
Output isn't correct |
41 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
42 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
43 |
Correct |
67 ms |
6656 KB |
Output is correct |
44 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
45 |
Incorrect |
67 ms |
6472 KB |
Output isn't correct |
46 |
Correct |
81 ms |
6492 KB |
Output is correct |
47 |
Incorrect |
67 ms |
6488 KB |
Output isn't correct |
48 |
Incorrect |
66 ms |
6640 KB |
Output isn't correct |
49 |
Correct |
64 ms |
6640 KB |
Output is correct |
50 |
Incorrect |
66 ms |
6648 KB |
Output isn't correct |
51 |
Incorrect |
67 ms |
6640 KB |
Output isn't correct |
52 |
Incorrect |
66 ms |
6488 KB |
Output isn't correct |
53 |
Incorrect |
66 ms |
6640 KB |
Output isn't correct |
54 |
Incorrect |
68 ms |
6648 KB |
Output isn't correct |
55 |
Incorrect |
68 ms |
6488 KB |
Output isn't correct |
56 |
Correct |
64 ms |
6492 KB |
Output is correct |
57 |
Incorrect |
81 ms |
6492 KB |
Output isn't correct |
58 |
Incorrect |
73 ms |
6644 KB |
Output isn't correct |
59 |
Incorrect |
68 ms |
6492 KB |
Output isn't correct |
60 |
Correct |
67 ms |
6488 KB |
Output is correct |
61 |
Correct |
63 ms |
6492 KB |
Output is correct |
62 |
Correct |
63 ms |
6492 KB |
Output is correct |
63 |
Correct |
70 ms |
6744 KB |
Output is correct |
64 |
Correct |
83 ms |
6644 KB |
Output is correct |
65 |
Incorrect |
68 ms |
6492 KB |
Output isn't correct |
66 |
Incorrect |
66 ms |
6492 KB |
Output isn't correct |
67 |
Incorrect |
68 ms |
6492 KB |
Output isn't correct |
68 |
Incorrect |
92 ms |
6640 KB |
Output isn't correct |
69 |
Incorrect |
68 ms |
6640 KB |
Output isn't correct |
70 |
Incorrect |
44 ms |
4444 KB |
Output isn't correct |
71 |
Incorrect |
71 ms |
6492 KB |
Output isn't correct |
72 |
Incorrect |
70 ms |
6488 KB |
Output isn't correct |
73 |
Incorrect |
70 ms |
6492 KB |
Output isn't correct |
74 |
Incorrect |
69 ms |
6492 KB |
Output isn't correct |
75 |
Incorrect |
73 ms |
6492 KB |
Output isn't correct |
76 |
Incorrect |
70 ms |
6492 KB |
Output isn't correct |
77 |
Incorrect |
69 ms |
6492 KB |
Output isn't correct |
78 |
Incorrect |
74 ms |
6736 KB |
Output isn't correct |
79 |
Incorrect |
71 ms |
6644 KB |
Output isn't correct |
80 |
Incorrect |
73 ms |
6636 KB |
Output isn't correct |
81 |
Incorrect |
70 ms |
6640 KB |
Output isn't correct |
82 |
Incorrect |
70 ms |
6644 KB |
Output isn't correct |
83 |
Incorrect |
74 ms |
6644 KB |
Output isn't correct |
84 |
Incorrect |
73 ms |
6488 KB |
Output isn't correct |
85 |
Incorrect |
68 ms |
6488 KB |
Output isn't correct |
86 |
Incorrect |
64 ms |
6640 KB |
Output isn't correct |
87 |
Incorrect |
75 ms |
6492 KB |
Output isn't correct |
88 |
Incorrect |
71 ms |
6492 KB |
Output isn't correct |
89 |
Incorrect |
67 ms |
6492 KB |
Output isn't correct |
90 |
Incorrect |
44 ms |
4444 KB |
Output isn't correct |
91 |
Incorrect |
69 ms |
6492 KB |
Output isn't correct |
92 |
Incorrect |
67 ms |
6492 KB |
Output isn't correct |
93 |
Incorrect |
66 ms |
6488 KB |
Output isn't correct |
94 |
Incorrect |
72 ms |
6492 KB |
Output isn't correct |
95 |
Incorrect |
68 ms |
6492 KB |
Output isn't correct |
96 |
Incorrect |
68 ms |
6492 KB |
Output isn't correct |
97 |
Incorrect |
64 ms |
6488 KB |
Output isn't correct |
98 |
Incorrect |
68 ms |
6644 KB |
Output isn't correct |
99 |
Incorrect |
67 ms |
6492 KB |
Output isn't correct |
100 |
Incorrect |
66 ms |
6892 KB |
Output isn't correct |