답안 #556173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
556173	2022-05-02T14:36:24 Z	ngpin04	Bomb (IZhO17_bomb)	C++14	90 / 100	526 ms	74656 KB

bomb

#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);
		}
	}
	
	for (int i = 2; i <= m; i++)
		mini(mx[i], mx[i - 1]);

	int ans = 0;
	for (int i = 1; i <= m; i++) 
		maxi(ans, i * mx[i]);	

	cout << ans;
	return 0;
}

Subtask #1

90.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	13 ms	30444 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	328 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	480 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	1492 KB	Output is correct
20	Correct	1 ms	1484 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	4824 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	7 ms	7764 KB	Output is correct
31	Correct	6 ms	6168 KB	Output is correct
32	Correct	6 ms	7180 KB	Output is correct
33	Correct	9 ms	8272 KB	Output is correct
34	Correct	4 ms	5588 KB	Output is correct
35	Correct	7 ms	8276 KB	Output is correct
36	Incorrect	8 ms	8276 KB	Output isn't correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	515 ms	74404 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	68 ms	20168 KB	Output is correct
41	Correct	1 ms	468 KB	Output is correct
42	Correct	1 ms	1620 KB	Output is correct
43	Correct	413 ms	74380 KB	Output is correct
44	Correct	7 ms	8276 KB	Output is correct
45	Correct	410 ms	74492 KB	Output is correct
46	Correct	373 ms	74440 KB	Output is correct
47	Correct	401 ms	74392 KB	Output is correct
48	Correct	389 ms	74516 KB	Output is correct
49	Incorrect	520 ms	74424 KB	Output isn't correct
50	Correct	390 ms	74416 KB	Output is correct
51	Correct	392 ms	74512 KB	Output is correct
52	Correct	377 ms	74296 KB	Output is correct
53	Correct	388 ms	74444 KB	Output is correct
54	Correct	289 ms	74316 KB	Output is correct
55	Correct	307 ms	74456 KB	Output is correct
56	Correct	494 ms	74448 KB	Output is correct
57	Correct	275 ms	74560 KB	Output is correct
58	Correct	298 ms	74436 KB	Output is correct
59	Correct	282 ms	74340 KB	Output is correct
60	Incorrect	375 ms	74344 KB	Output isn't correct
61	Incorrect	526 ms	74656 KB	Output isn't correct
62	Incorrect	522 ms	74404 KB	Output isn't correct
63	Incorrect	510 ms	74416 KB	Output isn't correct
64	Incorrect	323 ms	74432 KB	Output isn't correct
65	Correct	370 ms	74464 KB	Output is correct
66	Correct	353 ms	74388 KB	Output is correct
67	Correct	427 ms	74388 KB	Output is correct
68	Correct	432 ms	74384 KB	Output is correct
69	Correct	304 ms	74360 KB	Output is correct
70	Correct	146 ms	59496 KB	Output is correct
71	Correct	251 ms	74412 KB	Output is correct
72	Correct	277 ms	74376 KB	Output is correct
73	Correct	294 ms	74380 KB	Output is correct
74	Correct	293 ms	74464 KB	Output is correct
75	Correct	277 ms	74440 KB	Output is correct
76	Correct	286 ms	74364 KB	Output is correct
77	Correct	309 ms	74408 KB	Output is correct
78	Correct	319 ms	74324 KB	Output is correct
79	Correct	208 ms	74364 KB	Output is correct
80	Correct	197 ms	74476 KB	Output is correct
81	Correct	220 ms	74344 KB	Output is correct
82	Correct	319 ms	74328 KB	Output is correct
83	Correct	298 ms	74472 KB	Output is correct
84	Correct	210 ms	74488 KB	Output is correct
85	Correct	325 ms	74376 KB	Output is correct
86	Correct	502 ms	74316 KB	Output is correct
87	Correct	277 ms	74380 KB	Output is correct
88	Correct	319 ms	74372 KB	Output is correct
89	Correct	358 ms	74408 KB	Output is correct
90	Correct	191 ms	59468 KB	Output is correct
91	Correct	327 ms	74376 KB	Output is correct
92	Correct	363 ms	74436 KB	Output is correct
93	Correct	489 ms	74344 KB	Output is correct
94	Correct	368 ms	74432 KB	Output is correct
95	Correct	304 ms	74444 KB	Output is correct
96	Correct	334 ms	74452 KB	Output is correct
97	Correct	498 ms	74316 KB	Output is correct
98	Correct	319 ms	74384 KB	Output is correct
99	Correct	348 ms	74392 KB	Output is correct
100	Correct	505 ms	74436 KB	Output is correct