Submission #917917

# Submission time Handle Problem Language Result Execution time Memory
917917 2024-01-29T05:24:35 Z SeDunion Bomb (IZhO17_bomb) C++17
92 / 100
446 ms 80428 KB
#include <iostream>

using namespace std;

const int N = 2505;

int a[N][N], ans[N];

int L[N][N], R[N][N];

int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1 ; i <= n ; ++ i) {
		for (int j = 1 ; j <= m ; ++ j) {
			char c;
			cin >> c;
			a[i][j] = (c - '0');
		}
	}
	for (int i = 1 ; i <= n ; ++ i) {
		ans[i] = m;
	}
	int lim = n;
	for (int rep = 0 ; rep < 2 ; ++ rep) {
		for (int i = 1 ; i <= n ; ++ i) {
			for (int j = 1 ; j <= m ; ++ j) {
				if (a[i][j]) L[i][j] = L[i][j - 1] + 1;
				else L[i][j] = 0;
			}
			for (int j = m ; j >= 1 ; -- j) {
				if (a[i][j]) R[i][j] = R[i][j + 1] + 1;
				else R[i][j] = 0;
			}
		}
		for (int j = 1 ; j <= m ; ++ j) {
			int cnt = 0;
			int LX = -1, RX = -1;
			for (int i = 1 ; i <= n + 1 ; ++ i) {
					if (a[i][j]) {
					cnt++;
					if (cnt == 1) {
						LX = L[i][j], RX = R[i][j];
					}
					LX = min(LX, L[i][j]), RX = min(RX, R[i][j]);
					ans[cnt] = min(ans[cnt], LX + RX - 1);
				} else {
					if (cnt > 0) lim = min(lim, cnt);
					LX = RX = -1;
					cnt = 0;
				}
			}
		}
		for (int i = 1 ; i <= n / 2 ; ++ i) {
			for (int j = 1 ; j <= m ; ++ j) {
				swap(a[i][j], a[n - i + 1][j]);
			}
		}
	}
	int	res = 0;
	for (int i = 1 ; i <= lim ; ++ i) {
		//cerr << i << " " << ans[i] << endl;
		ans[i + 1] = min(ans[i + 1], ans[i]);
		res = max(res, ans[i] * i);
	}
	cout << res;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 13 ms 45000 KB Output is correct
4 Correct 13 ms 44892 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 2 ms 8796 KB Output is correct
18 Correct 2 ms 8796 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 2 ms 8644 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 8796 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 2 ms 7004 KB Output is correct
26 Incorrect 2 ms 5212 KB Output isn't correct
27 Incorrect 8 ms 9672 KB Output isn't correct
28 Correct 10 ms 15196 KB Output is correct
29 Correct 9 ms 14428 KB Output is correct
30 Correct 11 ms 14172 KB Output is correct
31 Correct 10 ms 14172 KB Output is correct
32 Correct 9 ms 14172 KB Output is correct
33 Correct 13 ms 20368 KB Output is correct
34 Correct 6 ms 16984 KB Output is correct
35 Correct 12 ms 21340 KB Output is correct
36 Incorrect 15 ms 13916 KB Output isn't correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 440 ms 80052 KB Output is correct
39 Correct 1 ms 6488 KB Output is correct
40 Correct 49 ms 27340 KB Output is correct
41 Correct 2 ms 6488 KB Output is correct
42 Correct 2 ms 9052 KB Output is correct
43 Correct 397 ms 80180 KB Output is correct
44 Correct 13 ms 19544 KB Output is correct
45 Correct 374 ms 80188 KB Output is correct
46 Correct 380 ms 79916 KB Output is correct
47 Correct 389 ms 80308 KB Output is correct
48 Correct 366 ms 79956 KB Output is correct
49 Incorrect 433 ms 80284 KB Output isn't correct
50 Correct 379 ms 79956 KB Output is correct
51 Correct 377 ms 80428 KB Output is correct
52 Correct 376 ms 80188 KB Output is correct
53 Correct 369 ms 80300 KB Output is correct
54 Correct 328 ms 79956 KB Output is correct
55 Correct 336 ms 80208 KB Output is correct
56 Correct 415 ms 79956 KB Output is correct
57 Correct 332 ms 80048 KB Output is correct
58 Correct 324 ms 80176 KB Output is correct
59 Correct 324 ms 80032 KB Output is correct
60 Correct 369 ms 79956 KB Output is correct
61 Incorrect 446 ms 80184 KB Output isn't correct
62 Incorrect 444 ms 80140 KB Output isn't correct
63 Incorrect 440 ms 80064 KB Output isn't correct
64 Correct 332 ms 79920 KB Output is correct
65 Correct 372 ms 80088 KB Output is correct
66 Correct 356 ms 79956 KB Output is correct
67 Correct 377 ms 80324 KB Output is correct
68 Correct 398 ms 80160 KB Output is correct
69 Correct 333 ms 80044 KB Output is correct
70 Correct 201 ms 68372 KB Output is correct
71 Correct 312 ms 80184 KB Output is correct
72 Correct 324 ms 79956 KB Output is correct
73 Correct 323 ms 80152 KB Output is correct
74 Correct 353 ms 80140 KB Output is correct
75 Correct 321 ms 79916 KB Output is correct
76 Correct 334 ms 80140 KB Output is correct
77 Correct 341 ms 80036 KB Output is correct
78 Correct 334 ms 80144 KB Output is correct
79 Correct 286 ms 80148 KB Output is correct
80 Correct 302 ms 79916 KB Output is correct
81 Correct 285 ms 80096 KB Output is correct
82 Correct 375 ms 80144 KB Output is correct
83 Correct 330 ms 79952 KB Output is correct
84 Correct 293 ms 80144 KB Output is correct
85 Correct 328 ms 80140 KB Output is correct
86 Correct 422 ms 80208 KB Output is correct
87 Correct 333 ms 80212 KB Output is correct
88 Correct 329 ms 80208 KB Output is correct
89 Correct 356 ms 80080 KB Output is correct
90 Correct 213 ms 67292 KB Output is correct
91 Correct 340 ms 80140 KB Output is correct
92 Correct 363 ms 80208 KB Output is correct
93 Correct 427 ms 80144 KB Output is correct
94 Correct 360 ms 79952 KB Output is correct
95 Correct 344 ms 79956 KB Output is correct
96 Correct 334 ms 79916 KB Output is correct
97 Correct 424 ms 80048 KB Output is correct
98 Correct 336 ms 80336 KB Output is correct
99 Correct 367 ms 80140 KB Output is correct
100 Correct 422 ms 80172 KB Output is correct