# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
170913 |
2019-12-26T17:17:13 Z |
davitmarg |
Bomb (IZhO17_bomb) |
C++17 |
|
964 ms |
80256 KB |
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
const int N = 2505;
int n, m, a[N][N], pr[N][N], nxt[N][N], d[N], Y, X, ans;
int get(int sy, int sx, int y, int x)
{
sy--;
sx--;
return pr[y][x] - pr[sy][x] - pr[y][sx] + pr[sy][sx];
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
char x;
scanf(" %c", &x);
a[i][j] += (x - '0');
pr[i][j] = a[i][j] + pr[i - 1][j] + pr[i][j - 1] - pr[i - 1][j - 1];
}
X = m;
Y = n;
for (int i = 1; i <= n; i++)
for (int j = m; j >= 1; j--)
{
if (a[i][j])
nxt[i][j] = nxt[i][j + 1] + 1;
else
nxt[i][j] = 0;
if (a[i][j - 1] == 0 && a[i][j])
X = min(X, nxt[i][j]);
}
for (int j = 1; j <= m; j++)
{
int y = 0;
for (int i = 1; i <= n; i++)
{
if (a[i][j])
y++;
else
y = 0;
if (a[i][j] && a[i + 1][j] == 0)
Y = min(y, Y);
}
}
for (int i = 1; i <= Y; i++)
d[i] = X;
for (int j = 1; j <= m; j++)
{
int y = 0, x = X;
for (int i = 1; i <= n; i++)
{
if (a[i][j] == 0)
{
y = 0;
x = X;
}
else
{
y++;
x = min(x, nxt[i][j]);
if (get(i - y + 1, j - 1, i, j - 1) != y)
d[y] = min(x, d[y]);
}
//cout << i << " : " << j << " = " << y << " : " << x << endl;
}
}
for (int j = 1; j <= m; j++)
{
int y = 0, x = X;
for (int i = n; i >= 1; i--)
{
if (a[i][j] == 0)
{
y = 0;
x = X;
}
else
{
y++;
x = min(x, nxt[i][j]);
if (get(i, j - 1, i + y - 1, j - 1) != y)
d[y] = min(x, d[y]);
}
//cout << i << " : " << j << " = " << y << " : " << x << endl;
}
}
for (int i = 1; i <= Y; i++)
{
//d[i + 1] = min(d[i + 1], d[i]);
//cout << i << " : " << d[i] << endl;
ans = max(ans, i * d[i]);
}
cout << ans << endl;
return 0;
}
/*
10 8
00000000
00111000
00111000
11111110
11101110
11111110
00111000
00111000
00000000
00000000
6 6
000111
000111
001111
111100
111000
111000
*/
Compilation message
bomb.cpp: In function 'int main()':
bomb.cpp:45:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf(" %c", &x);
~~~~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
636 KB |
Output is correct |
3 |
Correct |
38 ms |
30456 KB |
Output is correct |
4 |
Correct |
37 ms |
30456 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
368 KB |
Output is correct |
8 |
Correct |
2 ms |
632 KB |
Output is correct |
9 |
Correct |
2 ms |
504 KB |
Output is correct |
10 |
Correct |
2 ms |
504 KB |
Output is correct |
11 |
Correct |
2 ms |
604 KB |
Output is correct |
12 |
Correct |
2 ms |
504 KB |
Output is correct |
13 |
Correct |
2 ms |
504 KB |
Output is correct |
14 |
Correct |
2 ms |
504 KB |
Output is correct |
15 |
Correct |
2 ms |
632 KB |
Output is correct |
16 |
Correct |
2 ms |
632 KB |
Output is correct |
17 |
Correct |
3 ms |
1144 KB |
Output is correct |
18 |
Correct |
3 ms |
1272 KB |
Output is correct |
19 |
Correct |
5 ms |
1572 KB |
Output is correct |
20 |
Incorrect |
4 ms |
1528 KB |
Output isn't correct |
21 |
Correct |
3 ms |
1012 KB |
Output is correct |
22 |
Correct |
3 ms |
1272 KB |
Output is correct |
23 |
Correct |
4 ms |
1664 KB |
Output is correct |
24 |
Correct |
3 ms |
1400 KB |
Output is correct |
25 |
Incorrect |
4 ms |
1656 KB |
Output isn't correct |
26 |
Correct |
4 ms |
1656 KB |
Output is correct |
27 |
Correct |
13 ms |
4856 KB |
Output is correct |
28 |
Incorrect |
13 ms |
5240 KB |
Output isn't correct |
29 |
Incorrect |
18 ms |
6648 KB |
Output isn't correct |
30 |
Correct |
21 ms |
7928 KB |
Output is correct |
31 |
Correct |
17 ms |
6392 KB |
Output is correct |
32 |
Correct |
18 ms |
7288 KB |
Output is correct |
33 |
Incorrect |
23 ms |
8312 KB |
Output isn't correct |
34 |
Incorrect |
12 ms |
5624 KB |
Output isn't correct |
35 |
Correct |
22 ms |
8312 KB |
Output is correct |
36 |
Correct |
25 ms |
8312 KB |
Output is correct |
37 |
Correct |
2 ms |
632 KB |
Output is correct |
38 |
Correct |
934 ms |
79992 KB |
Output is correct |
39 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
40 |
Incorrect |
112 ms |
20728 KB |
Output isn't correct |
41 |
Correct |
2 ms |
632 KB |
Output is correct |
42 |
Correct |
4 ms |
1656 KB |
Output is correct |
43 |
Correct |
828 ms |
80256 KB |
Output is correct |
44 |
Correct |
24 ms |
8316 KB |
Output is correct |
45 |
Incorrect |
811 ms |
80120 KB |
Output isn't correct |
46 |
Correct |
782 ms |
80072 KB |
Output is correct |
47 |
Incorrect |
816 ms |
80120 KB |
Output isn't correct |
48 |
Correct |
786 ms |
80072 KB |
Output is correct |
49 |
Correct |
964 ms |
80248 KB |
Output is correct |
50 |
Correct |
793 ms |
80148 KB |
Output is correct |
51 |
Correct |
800 ms |
80120 KB |
Output is correct |
52 |
Correct |
801 ms |
80120 KB |
Output is correct |
53 |
Correct |
792 ms |
79992 KB |
Output is correct |
54 |
Correct |
699 ms |
79992 KB |
Output is correct |
55 |
Incorrect |
696 ms |
80248 KB |
Output isn't correct |
56 |
Correct |
937 ms |
80248 KB |
Output is correct |
57 |
Incorrect |
665 ms |
80064 KB |
Output isn't correct |
58 |
Correct |
660 ms |
80120 KB |
Output is correct |
59 |
Correct |
664 ms |
80120 KB |
Output is correct |
60 |
Correct |
782 ms |
79992 KB |
Output is correct |
61 |
Correct |
953 ms |
80148 KB |
Output is correct |
62 |
Correct |
954 ms |
80048 KB |
Output is correct |
63 |
Correct |
953 ms |
80196 KB |
Output is correct |
64 |
Correct |
646 ms |
79992 KB |
Output is correct |
65 |
Correct |
772 ms |
80120 KB |
Output is correct |
66 |
Correct |
784 ms |
80124 KB |
Output is correct |
67 |
Correct |
813 ms |
79992 KB |
Output is correct |
68 |
Correct |
837 ms |
80084 KB |
Output is correct |
69 |
Correct |
664 ms |
80104 KB |
Output is correct |
70 |
Incorrect |
361 ms |
63096 KB |
Output isn't correct |
71 |
Correct |
596 ms |
79992 KB |
Output is correct |
72 |
Incorrect |
645 ms |
80092 KB |
Output isn't correct |
73 |
Correct |
663 ms |
80060 KB |
Output is correct |
74 |
Correct |
646 ms |
80104 KB |
Output is correct |
75 |
Correct |
657 ms |
80056 KB |
Output is correct |
76 |
Incorrect |
678 ms |
80248 KB |
Output isn't correct |
77 |
Incorrect |
693 ms |
79960 KB |
Output isn't correct |
78 |
Incorrect |
675 ms |
80240 KB |
Output isn't correct |
79 |
Correct |
522 ms |
80112 KB |
Output is correct |
80 |
Correct |
552 ms |
80012 KB |
Output is correct |
81 |
Correct |
539 ms |
80016 KB |
Output is correct |
82 |
Incorrect |
682 ms |
80144 KB |
Output isn't correct |
83 |
Correct |
681 ms |
80248 KB |
Output is correct |
84 |
Correct |
525 ms |
80004 KB |
Output is correct |
85 |
Correct |
679 ms |
79956 KB |
Output is correct |
86 |
Correct |
914 ms |
80228 KB |
Output is correct |
87 |
Incorrect |
648 ms |
80096 KB |
Output isn't correct |
88 |
Correct |
686 ms |
80100 KB |
Output is correct |
89 |
Correct |
740 ms |
80248 KB |
Output is correct |
90 |
Correct |
403 ms |
63032 KB |
Output is correct |
91 |
Incorrect |
712 ms |
80128 KB |
Output isn't correct |
92 |
Incorrect |
768 ms |
80064 KB |
Output isn't correct |
93 |
Incorrect |
898 ms |
80064 KB |
Output isn't correct |
94 |
Correct |
742 ms |
80016 KB |
Output is correct |
95 |
Correct |
685 ms |
80016 KB |
Output is correct |
96 |
Correct |
688 ms |
80144 KB |
Output is correct |
97 |
Incorrect |
910 ms |
80204 KB |
Output isn't correct |
98 |
Incorrect |
676 ms |
80044 KB |
Output isn't correct |
99 |
Correct |
738 ms |
80048 KB |
Output is correct |
100 |
Correct |
890 ms |
80028 KB |
Output is correct |