| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 169896 |
2019-12-23T08:33:11 Z |
stefdasca |
Bomb (IZhO17_bomb) |
C++14 |
|
245 ms |
9336 KB |
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9
using namespace std;
typedef long long ll;
int add(int a, int b)
{
ll x = a+b;
if(x >= mod)
x -= mod;
if(x < 0)
x += mod;
return x;
}
ll mul(ll a, ll b)
{
return (a*b) % mod;
}
ll pw(ll a, ll b)
{
ll ans = 1;
while(b)
{
if(b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed()
{
long long a = rng();
return a;
}
char c[2600][2600];
int mars[2600][2600], sp[2600][2600];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; ++i)
cin >> (c[i] + 1);
int xx = 0;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
xx += (c[i][j] == '0');
if(!xx)
{
cout << n*m;
return 0;
}
if(n <= 450 && m <= 450)
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m; ++j)
{
sp[i][j] = (c[i][j] - '0') + sp[i-1][j] + sp[i][j-1] - sp[i-1][j-1];
}
}
int mxans = 0;
for(int i = n; i >= 1; --i)
{
int mnx = m;
for(int xx = 1; xx <= n; ++xx)
{
int str = 0;
for(int j = 1; j <= m; ++j)
{
if(c[xx][j] == '1')
++str;
else
{
if(str)
mnx = min(mnx, str);
str = 0;
}
}
if(str)
mnx = min(mnx, str);
}
int j = mnx;
if(i*j <= mxans)
continue;
for(int q = i; q <= n; ++q)
for(int p = j; p <= m; ++p)
{
if(sp[q][p] - sp[q - i][p] - sp[q][p - j] + sp[q - i][p - j] == i * j)
{
mars[q - i + 1][p - j + 1]++;
mars[q + 1][p - j + 1]--;
mars[q - i + 1][p + 1]--;
mars[q + 1][p + 1]++;
}
}
bool ok = 1;
for(int q = 1; q <= n; ++q)
for(int p = 1; p <= m; ++p)
{
mars[q][p] = mars[q][p] + mars[q-1][p] + mars[q][p-1] - mars[q-1][p-1];
if(c[q][p] == '1' && !mars[q][p])
{
ok = 0;
p = m+1;
q = n+1;
}
}
for(int q = 1; q <= n; ++q)
for(int p = 1; p <= m; ++p)
mars[q][p] = 0;
if(ok)
mxans = max(mxans, i*j);
}
cout << mxans;
}
else
{
int mnx = m, mny = n;
for(int i = 1; i <= n; ++i)
{
int str = 0;
for(int j = 1; j <= m; ++j)
{
if(c[i][j] == '1')
++str;
else
{
if(str)
mnx = min(mnx, str);
str = 0;
}
}
if(str)
mnx = min(mnx, str);
}
for(int j = 1; j <= m; ++j)
{
int str = 0;
for(int i = 1; i <= n; ++i)
{
if(c[i][j] == '1')
++str;
else
{
if(str)
mny = min(mny, str);
str = 0;
}
}
if(str)
mny = min(mny, str);
}
cout << mnx * mny << '\n';
}
return 0;
}
Compilation message
bomb.cpp: In function 'int main()':
bomb.cpp:114:34: warning: assuming signed overflow does not occur when assuming that (X + c) >= X is always true [-Wstrict-overflow]
for(int p = 1; p <= m; ++p)
~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
7 ms |
6648 KB |
Output is correct |
| 4 |
Correct |
7 ms |
6776 KB |
Output is correct |
| 5 |
Correct |
2 ms |
348 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
632 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
604 KB |
Output isn't 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 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
| 16 |
Correct |
2 ms |
504 KB |
Output is correct |
| 17 |
Correct |
4 ms |
1144 KB |
Output is correct |
| 18 |
Incorrect |
3 ms |
1144 KB |
Output isn't correct |
| 19 |
Incorrect |
4 ms |
1400 KB |
Output isn't correct |
| 20 |
Incorrect |
5 ms |
1400 KB |
Output isn't correct |
| 21 |
Incorrect |
3 ms |
888 KB |
Output isn't correct |
| 22 |
Incorrect |
4 ms |
1144 KB |
Output isn't correct |
| 23 |
Incorrect |
5 ms |
1528 KB |
Output isn't correct |
| 24 |
Incorrect |
4 ms |
1272 KB |
Output isn't correct |
| 25 |
Incorrect |
5 ms |
1528 KB |
Output isn't correct |
| 26 |
Correct |
5 ms |
1528 KB |
Output is correct |
| 27 |
Correct |
79 ms |
4216 KB |
Output is correct |
| 28 |
Incorrect |
68 ms |
4344 KB |
Output isn't correct |
| 29 |
Incorrect |
125 ms |
5496 KB |
Output isn't correct |
| 30 |
Incorrect |
178 ms |
6392 KB |
Output isn't correct |
| 31 |
Incorrect |
112 ms |
5112 KB |
Output isn't correct |
| 32 |
Incorrect |
148 ms |
5900 KB |
Output isn't correct |
| 33 |
Incorrect |
213 ms |
6780 KB |
Output isn't correct |
| 34 |
Incorrect |
66 ms |
4788 KB |
Output isn't correct |
| 35 |
Incorrect |
170 ms |
6776 KB |
Output isn't correct |
| 36 |
Correct |
245 ms |
6732 KB |
Output is correct |
| 37 |
Correct |
2 ms |
632 KB |
Output is correct |
| 38 |
Correct |
16 ms |
6648 KB |
Output is correct |
| 39 |
Correct |
2 ms |
504 KB |
Output is correct |
| 40 |
Incorrect |
8 ms |
2552 KB |
Output isn't correct |
| 41 |
Incorrect |
3 ms |
508 KB |
Output isn't correct |
| 42 |
Incorrect |
6 ms |
1528 KB |
Output isn't correct |
| 43 |
Correct |
46 ms |
6732 KB |
Output is correct |
| 44 |
Incorrect |
231 ms |
6740 KB |
Output isn't correct |
| 45 |
Incorrect |
45 ms |
6780 KB |
Output isn't correct |
| 46 |
Correct |
54 ms |
6780 KB |
Output is correct |
| 47 |
Incorrect |
46 ms |
6876 KB |
Output isn't correct |
| 48 |
Incorrect |
46 ms |
6776 KB |
Output isn't correct |
| 49 |
Correct |
49 ms |
7800 KB |
Output is correct |
| 50 |
Incorrect |
44 ms |
6776 KB |
Output isn't correct |
| 51 |
Incorrect |
46 ms |
7740 KB |
Output isn't correct |
| 52 |
Incorrect |
42 ms |
6908 KB |
Output isn't correct |
| 53 |
Incorrect |
41 ms |
7800 KB |
Output isn't correct |
| 54 |
Incorrect |
45 ms |
7804 KB |
Output isn't correct |
| 55 |
Incorrect |
40 ms |
7672 KB |
Output isn't correct |
| 56 |
Correct |
43 ms |
7800 KB |
Output is correct |
| 57 |
Incorrect |
41 ms |
7776 KB |
Output isn't correct |
| 58 |
Incorrect |
40 ms |
7672 KB |
Output isn't correct |
| 59 |
Incorrect |
38 ms |
7800 KB |
Output isn't correct |
| 60 |
Correct |
39 ms |
7672 KB |
Output is correct |
| 61 |
Correct |
42 ms |
8696 KB |
Output is correct |
| 62 |
Correct |
45 ms |
7800 KB |
Output is correct |
| 63 |
Correct |
43 ms |
8568 KB |
Output is correct |
| 64 |
Correct |
45 ms |
7776 KB |
Output is correct |
| 65 |
Incorrect |
47 ms |
8312 KB |
Output isn't correct |
| 66 |
Incorrect |
41 ms |
6776 KB |
Output isn't correct |
| 67 |
Incorrect |
42 ms |
9208 KB |
Output isn't correct |
| 68 |
Incorrect |
42 ms |
8952 KB |
Output isn't correct |
| 69 |
Incorrect |
39 ms |
9336 KB |
Output isn't correct |
| 70 |
Incorrect |
23 ms |
5368 KB |
Output isn't correct |
| 71 |
Incorrect |
39 ms |
7532 KB |
Output isn't correct |
| 72 |
Incorrect |
46 ms |
8752 KB |
Output isn't correct |
| 73 |
Incorrect |
40 ms |
8184 KB |
Output isn't correct |
| 74 |
Incorrect |
40 ms |
8568 KB |
Output isn't correct |
| 75 |
Incorrect |
45 ms |
8440 KB |
Output isn't correct |
| 76 |
Incorrect |
39 ms |
8628 KB |
Output isn't correct |
| 77 |
Incorrect |
41 ms |
7800 KB |
Output isn't correct |
| 78 |
Incorrect |
44 ms |
8056 KB |
Output isn't correct |
| 79 |
Incorrect |
38 ms |
7932 KB |
Output isn't correct |
| 80 |
Incorrect |
39 ms |
8952 KB |
Output isn't correct |
| 81 |
Incorrect |
39 ms |
7544 KB |
Output isn't correct |
| 82 |
Incorrect |
40 ms |
7800 KB |
Output isn't correct |
| 83 |
Incorrect |
39 ms |
7928 KB |
Output isn't correct |
| 84 |
Incorrect |
40 ms |
8696 KB |
Output isn't correct |
| 85 |
Incorrect |
38 ms |
8184 KB |
Output isn't correct |
| 86 |
Incorrect |
42 ms |
8756 KB |
Output isn't correct |
| 87 |
Incorrect |
40 ms |
8696 KB |
Output isn't correct |
| 88 |
Incorrect |
41 ms |
8696 KB |
Output isn't correct |
| 89 |
Incorrect |
40 ms |
7584 KB |
Output isn't correct |
| 90 |
Incorrect |
24 ms |
5880 KB |
Output isn't correct |
| 91 |
Incorrect |
39 ms |
8568 KB |
Output isn't correct |
| 92 |
Incorrect |
37 ms |
8696 KB |
Output isn't correct |
| 93 |
Incorrect |
41 ms |
7956 KB |
Output isn't correct |
| 94 |
Incorrect |
41 ms |
8800 KB |
Output isn't correct |
| 95 |
Incorrect |
41 ms |
8700 KB |
Output isn't correct |
| 96 |
Incorrect |
42 ms |
8796 KB |
Output isn't correct |
| 97 |
Incorrect |
41 ms |
8824 KB |
Output isn't correct |
| 98 |
Incorrect |
38 ms |
8824 KB |
Output isn't correct |
| 99 |
Incorrect |
40 ms |
8824 KB |
Output isn't correct |
| 100 |
Incorrect |
42 ms |
8824 KB |
Output isn't correct |
