# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
399960 |
2021-05-07T01:37:00 Z |
abc864197532 |
Bomb (IZhO17_bomb) |
C++17 |
|
170 ms |
13292 KB |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define info() cerr << __PRETTY_FUNCTION__ << ": " << __LINE__ << endl
#define test(args...) info(), abc("[" + string(#args) + "]", args)
void abc() {cerr << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
cerr << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
bool is = false;
for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
return o << '}';
}
const int N = 1000087, logN = 20, K = 111;
int main () {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
string s[n];
for (int i = 0; i < n; ++i) cin >> s[i];
vector <int> cnt(m, 0), len(m + 1, 1 << 30);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cnt[j] = s[i][j] == '0' ? 0 : cnt[j] + 1;
}
vector <int> l(m), r(m);
stack <int> stk;
for (int j = 0; j < m; ++j) {
if (!stk.empty() && cnt[stk.top()] >= cnt[j]) stk.pop();
l[j] = stk.empty() ? j + 1 : j - stk.top();
stk.push(j);
}
while (!stk.empty()) stk.pop();
for (int j = m - 1; ~j; --j) {
if (!stk.empty() && cnt[stk.top()] >= cnt[j]) stk.pop();
r[j] = stk.empty() ? m - j : stk.top() - j;
stk.push(j);
}
for (int j = 0; j < m; ++j) if (cnt[j] > 0) {
len[cnt[j]] = min(len[cnt[j]], l[j] + r[j] - 1);
}
}
int mn = m;
for (int j = 0; j < m; ++j) {
int now = 0;
for (int i = 0; i < n; ++i) {
if (s[i][j] == '0') {
if (now > 0) mn = min(mn, now);
now = 0;
}
else now++;
}
if (now > 0) mn = min(mn, now);
}
int ans = 0;
for (int i = 1; i <= mn; ++i) ans = max(ans, len[i] * i);
cout << ans << endl;
}
/*
5 6
001000
111110
111110
111110
000100
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Runtime error |
1 ms |
588 KB |
Execution killed with signal 6 |
4 |
Runtime error |
1 ms |
588 KB |
Execution killed with signal 6 |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
10 |
Correct |
1 ms |
320 KB |
Output is correct |
11 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
208 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
20 |
Correct |
1 ms |
332 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
23 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
24 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
27 |
Runtime error |
4 ms |
716 KB |
Execution killed with signal 6 |
28 |
Incorrect |
3 ms |
460 KB |
Output isn't correct |
29 |
Runtime error |
4 ms |
844 KB |
Execution killed with signal 6 |
30 |
Incorrect |
5 ms |
716 KB |
Output isn't correct |
31 |
Incorrect |
4 ms |
528 KB |
Output isn't correct |
32 |
Incorrect |
4 ms |
652 KB |
Output isn't correct |
33 |
Correct |
5 ms |
716 KB |
Output is correct |
34 |
Incorrect |
3 ms |
460 KB |
Output isn't correct |
35 |
Incorrect |
5 ms |
716 KB |
Output isn't correct |
36 |
Incorrect |
6 ms |
716 KB |
Output isn't correct |
37 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
38 |
Correct |
153 ms |
13196 KB |
Output is correct |
39 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
40 |
Correct |
19 ms |
1868 KB |
Output is correct |
41 |
Correct |
1 ms |
204 KB |
Output is correct |
42 |
Correct |
1 ms |
332 KB |
Output is correct |
43 |
Incorrect |
154 ms |
13172 KB |
Output isn't correct |
44 |
Correct |
5 ms |
720 KB |
Output is correct |
45 |
Incorrect |
156 ms |
13188 KB |
Output isn't correct |
46 |
Correct |
138 ms |
13132 KB |
Output is correct |
47 |
Incorrect |
144 ms |
13192 KB |
Output isn't correct |
48 |
Incorrect |
136 ms |
13184 KB |
Output isn't correct |
49 |
Incorrect |
152 ms |
13196 KB |
Output isn't correct |
50 |
Incorrect |
140 ms |
13184 KB |
Output isn't correct |
51 |
Incorrect |
143 ms |
13184 KB |
Output isn't correct |
52 |
Incorrect |
150 ms |
13288 KB |
Output isn't correct |
53 |
Incorrect |
147 ms |
13176 KB |
Output isn't correct |
54 |
Incorrect |
142 ms |
13132 KB |
Output isn't correct |
55 |
Incorrect |
141 ms |
13092 KB |
Output isn't correct |
56 |
Correct |
160 ms |
13188 KB |
Output is correct |
57 |
Incorrect |
131 ms |
13132 KB |
Output isn't correct |
58 |
Incorrect |
142 ms |
13160 KB |
Output isn't correct |
59 |
Incorrect |
141 ms |
13132 KB |
Output isn't correct |
60 |
Incorrect |
156 ms |
13252 KB |
Output isn't correct |
61 |
Incorrect |
166 ms |
13184 KB |
Output isn't correct |
62 |
Incorrect |
170 ms |
13132 KB |
Output isn't correct |
63 |
Incorrect |
164 ms |
13200 KB |
Output isn't correct |
64 |
Incorrect |
157 ms |
13132 KB |
Output isn't correct |
65 |
Incorrect |
158 ms |
13184 KB |
Output isn't correct |
66 |
Incorrect |
157 ms |
13096 KB |
Output isn't correct |
67 |
Incorrect |
153 ms |
13180 KB |
Output isn't correct |
68 |
Incorrect |
161 ms |
13132 KB |
Output isn't correct |
69 |
Incorrect |
151 ms |
13132 KB |
Output isn't correct |
70 |
Incorrect |
81 ms |
8484 KB |
Output isn't correct |
71 |
Incorrect |
148 ms |
13252 KB |
Output isn't correct |
72 |
Correct |
151 ms |
13220 KB |
Output is correct |
73 |
Incorrect |
146 ms |
13184 KB |
Output isn't correct |
74 |
Incorrect |
150 ms |
13184 KB |
Output isn't correct |
75 |
Incorrect |
154 ms |
13252 KB |
Output isn't correct |
76 |
Correct |
149 ms |
13120 KB |
Output is correct |
77 |
Correct |
154 ms |
13132 KB |
Output is correct |
78 |
Correct |
149 ms |
13084 KB |
Output is correct |
79 |
Incorrect |
150 ms |
13132 KB |
Output isn't correct |
80 |
Incorrect |
149 ms |
13192 KB |
Output isn't correct |
81 |
Incorrect |
151 ms |
13180 KB |
Output isn't correct |
82 |
Correct |
165 ms |
13180 KB |
Output is correct |
83 |
Incorrect |
152 ms |
13168 KB |
Output isn't correct |
84 |
Incorrect |
149 ms |
13184 KB |
Output isn't correct |
85 |
Incorrect |
154 ms |
13100 KB |
Output isn't correct |
86 |
Incorrect |
162 ms |
13176 KB |
Output isn't correct |
87 |
Correct |
153 ms |
13132 KB |
Output is correct |
88 |
Incorrect |
157 ms |
13132 KB |
Output isn't correct |
89 |
Incorrect |
158 ms |
13268 KB |
Output isn't correct |
90 |
Incorrect |
85 ms |
8540 KB |
Output isn't correct |
91 |
Correct |
156 ms |
13132 KB |
Output is correct |
92 |
Correct |
159 ms |
13092 KB |
Output is correct |
93 |
Correct |
169 ms |
13188 KB |
Output is correct |
94 |
Incorrect |
159 ms |
13200 KB |
Output isn't correct |
95 |
Incorrect |
157 ms |
13184 KB |
Output isn't correct |
96 |
Incorrect |
154 ms |
13184 KB |
Output isn't correct |
97 |
Correct |
161 ms |
13292 KB |
Output is correct |
98 |
Correct |
164 ms |
13252 KB |
Output is correct |
99 |
Incorrect |
154 ms |
13188 KB |
Output isn't correct |
100 |
Incorrect |
165 ms |
13132 KB |
Output isn't correct |