Submission #556168

# Submission time Handle Problem Language Result Execution time Memory
556168 2022-05-02T14:29:19 Z ngpin04 Bomb (IZhO17_bomb) C++14
90 / 100
453 ms 75396 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
const int N = 2505;
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

int up[N][N];
int dn[N][N];
int a[N][N];
int mx[N];
int n,m;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		string str; cin >> str;
		for (int j = 1; j <= m; j++)
			a[i][j] = str[j - 1] - '0';
	}	

	for (int j = 1; j <= m; j++) {
		for (int i = 1; i <= n; i++) 
			if (a[i][j])
				up[i][j] = up[i - 1][j] + 1;

		for (int i = n; i >= 1; i--)
			if (a[i][j])
				dn[i][j] = dn[i + 1][j] + 1;

		for (int i = 1; i <= n; i++)
			if (a[i][j])
				mini(mx[1], up[i][j] + dn[i][j] - 1);
	}

	for (int i = 1; i <= m; i++)
		mx[i] = oo;

	for (int t = 0; t < 2; t++) {
		for (int i = 1; i <= n; i++) { 
			for (int j = 1; j <= m; j++) if (a[i][j]) {
				int k = j;
				while (a[i][k])
					k++;

				int f = oo, g = oo;
				for (int it = j; it < k; it++) {
					mini(f, up[i][it]);
					mini(g, dn[i][it]);

					// cerr << i << " " << j << " " << it << " " << f << " " << g << "\n";
					mini(mx[it - j + 1], f + g - 1);
				}

				mini(mx[k - j + 1], 0);
				j = k;
			}

		}
		for (int i = 1; i <= n; i++) {
			reverse(a[i] + 1, a[i] + m + 1);
			reverse(dn[i] + 1, dn[i] + m + 1);
			reverse(up[i] + 1, up[i] + m + 1);
		}
	}
	
	int ans = 0;
	for (int i = 1; i <= m; i++) {
		if (mx[i] == 0)
			break;
		maxi(ans, i * mx[i]);
	}

	cout << ans;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 12 ms 30376 KB Output is correct
4 Correct 12 ms 30420 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 1 ms 324 KB Output isn't correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1620 KB Output is correct
24 Correct 1 ms 1364 KB Output is correct
25 Correct 1 ms 1616 KB Output is correct
26 Incorrect 1 ms 1620 KB Output isn't correct
27 Incorrect 4 ms 4792 KB Output isn't correct
28 Correct 4 ms 5204 KB Output is correct
29 Correct 6 ms 6612 KB Output is correct
30 Correct 6 ms 7892 KB Output is correct
31 Correct 5 ms 6228 KB Output is correct
32 Correct 8 ms 7124 KB Output is correct
33 Correct 7 ms 8276 KB Output is correct
34 Correct 5 ms 5576 KB Output is correct
35 Correct 7 ms 8360 KB Output is correct
36 Incorrect 13 ms 8276 KB Output isn't correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 392 ms 74952 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 53 ms 20584 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 1620 KB Output is correct
43 Correct 369 ms 75040 KB Output is correct
44 Correct 7 ms 8296 KB Output is correct
45 Correct 361 ms 75068 KB Output is correct
46 Correct 353 ms 75080 KB Output is correct
47 Correct 357 ms 75196 KB Output is correct
48 Correct 365 ms 75068 KB Output is correct
49 Incorrect 450 ms 75196 KB Output isn't correct
50 Correct 344 ms 75000 KB Output is correct
51 Correct 343 ms 75032 KB Output is correct
52 Correct 322 ms 75064 KB Output is correct
53 Correct 345 ms 75104 KB Output is correct
54 Correct 267 ms 75024 KB Output is correct
55 Correct 277 ms 75160 KB Output is correct
56 Correct 453 ms 75068 KB Output is correct
57 Correct 263 ms 74956 KB Output is correct
58 Correct 271 ms 74968 KB Output is correct
59 Correct 273 ms 75168 KB Output is correct
60 Incorrect 324 ms 75132 KB Output isn't correct
61 Incorrect 422 ms 75056 KB Output isn't correct
62 Incorrect 446 ms 75052 KB Output isn't correct
63 Incorrect 423 ms 75224 KB Output isn't correct
64 Incorrect 271 ms 74988 KB Output isn't correct
65 Correct 295 ms 75156 KB Output is correct
66 Correct 334 ms 75236 KB Output is correct
67 Correct 350 ms 75056 KB Output is correct
68 Correct 363 ms 75040 KB Output is correct
69 Correct 256 ms 75120 KB Output is correct
70 Correct 146 ms 59904 KB Output is correct
71 Correct 227 ms 75040 KB Output is correct
72 Correct 238 ms 75060 KB Output is correct
73 Correct 250 ms 75124 KB Output is correct
74 Correct 249 ms 75088 KB Output is correct
75 Correct 253 ms 75112 KB Output is correct
76 Correct 268 ms 75064 KB Output is correct
77 Correct 262 ms 75040 KB Output is correct
78 Correct 266 ms 75128 KB Output is correct
79 Correct 188 ms 75076 KB Output is correct
80 Correct 193 ms 75396 KB Output is correct
81 Correct 219 ms 75112 KB Output is correct
82 Correct 252 ms 75104 KB Output is correct
83 Correct 268 ms 75344 KB Output is correct
84 Correct 172 ms 75176 KB Output is correct
85 Correct 259 ms 75172 KB Output is correct
86 Correct 422 ms 75172 KB Output is correct
87 Correct 273 ms 75272 KB Output is correct
88 Correct 269 ms 75376 KB Output is correct
89 Correct 326 ms 75100 KB Output is correct
90 Correct 157 ms 59820 KB Output is correct
91 Correct 294 ms 74948 KB Output is correct
92 Correct 317 ms 75100 KB Output is correct
93 Correct 425 ms 74916 KB Output is correct
94 Correct 326 ms 74920 KB Output is correct
95 Correct 258 ms 74820 KB Output is correct
96 Correct 264 ms 74876 KB Output is correct
97 Correct 409 ms 75128 KB Output is correct
98 Correct 250 ms 74984 KB Output is correct
99 Correct 298 ms 74924 KB Output is correct
100 Correct 400 ms 74868 KB Output is correct