oj.uz

답안 #1065369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065369 2024-08-19T06:43:03 Z Gromp15 축구 경기장 (IOI23_soccer) C++17
61 / 100
 287 ms 39888 KB 
#include <bits/stdc++.h>
#include "soccer.h"
#define ar array
#define ll long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

const int nax = 31;
int dp[nax][nax][nax][nax];
int biggest_stadium(int n, std::vector<std::vector<int>> F)
{
	if (n > 30) {
		vector<ar<int, 2>> ints(n);
		int L = -1, R = -1;
		for (int i = 0; i < n; i++) {
			int u = 0;
			for (int j = 0; j < n; j++) if (!F[i][j]) {
				int r = j;
				while (r+1 < n && !F[i][r+1]) r++;
				ints[i] = {j, r};
				if (++u == 2) return 0;
				j = r;
			}
			if (u) {
				if (!~L) L = i;
				else {
					if (R != i-1) return 0;
				}
				R = i;
			}
		}
		int len = -1, idx = -1;
		for (int i = L; i <= R; i++) {
			if (ckmax(len, ints[i][1] - ints[i][0])) idx = i;
		}
		for (int i = idx-1; i >= L; i--) {
			if (!(ints[i][0] >= ints[i+1][0] && ints[i][1] <= ints[i+1][1])) {
				return 0;
			}
		}
		for (int i = idx+1; i <= R; i++) {
			if (!(ints[i][0] >= ints[i-1][0] && ints[i][1] <= ints[i-1][1])) {
				return 0;
			}
		}
		for (int i = L; i <= R; i++) {
			for (int j = L; j <= R; j++) {
				auto [L1, R1] = ints[i];
				auto [L2, R2] = ints[j];
				if (L1 > L2 || (L1 == L2 && R1 < R2)) swap(L1, L2), swap(R1, R2);
				if (R1 < R2) return 0;
			}
		}
		int tot = 0;
		for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) tot += !F[i][j];
		return tot;
	}
	memset(dp, 0xc1, sizeof(dp));
	vector<vector<int>> to(n, vector<int>(n, -1));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) if (!F[i][j]) {
			int r = j;
			while (r+1 < n && !F[i][r+1]) r++;
			for (int k = j; k <= r; k++) to[i][k] = r;
			dp[i][i][j][r] = r-j+1;
			j = r;
		}
	}
	for (int len = 1; len < n; len++) {
		for (int i = 0; i+len-1 < n; i++) {
			int j = i+len-1;
			for (int l = 0; l < n; l++) {
				for (int r = l; r < n; r++) if (dp[i][j][l][r] > 0) {
					if (i) {
						for (int z = l; z <= r; z++) if (~to[i-1][z]) {
							int new_r = min(to[i-1][z], r);
							ckmax(dp[i-1][j][z][new_r], dp[i][j][l][r] + new_r - z + 1);
						}
					}
					if (j+1 < n) {
						for (int z = l; z <= r; z++) if (~to[j+1][z]) {
							int new_r = min(to[j+1][z], r);
							ckmax(dp[i][j+1][z][new_r], dp[i][j][l][r] + new_r - z + 1);
						}
					}
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++) for (int j = i; j < n; j++) for (int k = 0; k < n; k++) for (int l = k; l < n; l++) ckmax(ans, dp[i][j][k][l]);
	return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok
2 Correct 1 ms 3932 KB ok
3 Correct 1 ms 4052 KB ok
4 Correct 2 ms 3932 KB ok
5 Correct 1 ms 3932 KB ok
6 Correct 1 ms 3924 KB ok
7 Partially correct 1 ms 348 KB partial
8 Partially correct 13 ms 2704 KB partial
9 Partially correct 197 ms 39600 KB partial

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok
2 Correct 1 ms 3932 KB ok
3 Correct 2 ms 3928 KB ok
4 Correct 1 ms 3928 KB ok
5 Correct 1 ms 3932 KB ok
6 Correct 1 ms 3940 KB ok
7 Correct 1 ms 3932 KB ok
8 Correct 1 ms 3932 KB ok
9 Correct 1 ms 3932 KB ok
10 Correct 2 ms 3932 KB ok
11 Correct 1 ms 3928 KB ok
12 Correct 1 ms 4184 KB ok
13 Correct 1 ms 3932 KB ok

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok
2 Correct 1 ms 3928 KB ok
3 Correct 1 ms 3932 KB ok
4 Correct 2 ms 3928 KB ok
5 Correct 1 ms 3928 KB ok
6 Correct 1 ms 3932 KB ok
7 Correct 1 ms 3940 KB ok
8 Correct 1 ms 3932 KB ok
9 Correct 1 ms 3932 KB ok
10 Correct 1 ms 3932 KB ok
11 Correct 2 ms 3932 KB ok
12 Correct 1 ms 3928 KB ok
13 Correct 1 ms 4184 KB ok
14 Correct 1 ms 3932 KB ok
15 Correct 1 ms 3932 KB ok
16 Correct 1 ms 3932 KB ok
17 Correct 1 ms 3932 KB ok
18 Correct 1 ms 3932 KB ok
19 Correct 1 ms 3932 KB ok
20 Correct 1 ms 3932 KB ok
21 Correct 1 ms 3932 KB ok
22 Correct 1 ms 3932 KB ok
23 Correct 1 ms 3932 KB ok
24 Correct 1 ms 3932 KB ok
25 Correct 1 ms 3932 KB ok
26 Correct 1 ms 3932 KB ok

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok
2 Correct 1 ms 3928 KB ok
3 Correct 1 ms 3932 KB ok
4 Correct 1 ms 4052 KB ok
5 Correct 2 ms 3932 KB ok
6 Correct 2 ms 3928 KB ok
7 Correct 1 ms 3928 KB ok
8 Correct 1 ms 3932 KB ok
9 Correct 1 ms 3940 KB ok
10 Correct 1 ms 3932 KB ok
11 Correct 1 ms 3932 KB ok
12 Correct 1 ms 3932 KB ok
13 Correct 2 ms 3932 KB ok
14 Correct 1 ms 3928 KB ok
15 Correct 1 ms 4184 KB ok
16 Correct 1 ms 3932 KB ok
17 Correct 1 ms 3932 KB ok
18 Correct 1 ms 3932 KB ok
19 Correct 1 ms 3932 KB ok
20 Correct 1 ms 3932 KB ok
21 Correct 1 ms 3932 KB ok
22 Correct 1 ms 3932 KB ok
23 Correct 1 ms 3932 KB ok
24 Correct 1 ms 3932 KB ok
25 Correct 1 ms 3932 KB ok
26 Correct 1 ms 3932 KB ok
27 Correct 1 ms 3932 KB ok
28 Correct 1 ms 3932 KB ok
29 Correct 1 ms 3932 KB ok
30 Correct 2 ms 3932 KB ok
31 Correct 1 ms 3932 KB ok
32 Correct 1 ms 3932 KB ok
33 Correct 1 ms 3932 KB ok
34 Correct 2 ms 3928 KB ok
35 Correct 2 ms 3932 KB ok
36 Correct 1 ms 3932 KB ok
37 Correct 1 ms 3932 KB ok
38 Correct 1 ms 3932 KB ok
39 Correct 1 ms 3932 KB ok
40 Correct 2 ms 3932 KB ok
41 Correct 2 ms 3932 KB ok

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok
2 Correct 1 ms 3928 KB ok
3 Correct 1 ms 3932 KB ok
4 Correct 1 ms 4052 KB ok
5 Correct 2 ms 3932 KB ok
6 Correct 2 ms 3928 KB ok
7 Correct 1 ms 3928 KB ok
8 Correct 1 ms 3932 KB ok
9 Correct 1 ms 3940 KB ok
10 Correct 1 ms 3932 KB ok
11 Correct 1 ms 3932 KB ok
12 Correct 1 ms 3932 KB ok
13 Correct 2 ms 3932 KB ok
14 Correct 1 ms 3928 KB ok
15 Correct 1 ms 4184 KB ok
16 Correct 1 ms 3932 KB ok
17 Correct 1 ms 3932 KB ok
18 Correct 1 ms 3932 KB ok
19 Correct 1 ms 3932 KB ok
20 Correct 1 ms 3932 KB ok
21 Correct 1 ms 3932 KB ok
22 Correct 1 ms 3932 KB ok
23 Correct 1 ms 3932 KB ok
24 Correct 1 ms 3932 KB ok
25 Correct 1 ms 3932 KB ok
26 Correct 1 ms 3932 KB ok
27 Correct 1 ms 3932 KB ok
28 Correct 1 ms 3932 KB ok
29 Correct 1 ms 3932 KB ok
30 Correct 2 ms 3932 KB ok
31 Correct 1 ms 3932 KB ok
32 Correct 1 ms 3932 KB ok
33 Correct 1 ms 3932 KB ok
34 Correct 2 ms 3928 KB ok
35 Correct 2 ms 3932 KB ok
36 Correct 1 ms 3932 KB ok
37 Correct 1 ms 3932 KB ok
38 Correct 1 ms 3932 KB ok
39 Correct 1 ms 3932 KB ok
40 Correct 2 ms 3932 KB ok
41 Correct 2 ms 3932 KB ok
42 Partially correct 13 ms 2904 KB partial
43 Partially correct 13 ms 2908 KB partial
44 Partially correct 17 ms 2908 KB partial
45 Partially correct 13 ms 2908 KB partial
46 Partially correct 13 ms 2908 KB partial
47 Partially correct 13 ms 2908 KB partial
48 Correct 13 ms 2904 KB ok
49 Partially correct 13 ms 2908 KB partial
50 Partially correct 13 ms 2908 KB partial
51 Partially correct 14 ms 2908 KB partial
52 Partially correct 13 ms 2908 KB partial
53 Partially correct 14 ms 2908 KB partial
54 Partially correct 13 ms 2828 KB partial
55 Partially correct 13 ms 2908 KB partial
56 Partially correct 13 ms 2904 KB partial
57 Partially correct 13 ms 2700 KB partial
58 Partially correct 13 ms 2908 KB partial
59 Partially correct 13 ms 2908 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ok
2 Correct 1 ms 3928 KB ok
3 Correct 1 ms 3932 KB ok
4 Correct 1 ms 4052 KB ok
5 Correct 2 ms 3932 KB ok
6 Correct 1 ms 3932 KB ok
7 Correct 1 ms 3924 KB ok
8 Partially correct 1 ms 348 KB partial
9 Partially correct 13 ms 2704 KB partial
10 Partially correct 197 ms 39600 KB partial
11 Correct 2 ms 3928 KB ok
12 Correct 1 ms 3928 KB ok
13 Correct 1 ms 3932 KB ok
14 Correct 1 ms 3940 KB ok
15 Correct 1 ms 3932 KB ok
16 Correct 1 ms 3932 KB ok
17 Correct 1 ms 3932 KB ok
18 Correct 2 ms 3932 KB ok
19 Correct 1 ms 3928 KB ok
20 Correct 1 ms 4184 KB ok
21 Correct 1 ms 3932 KB ok
22 Correct 1 ms 3932 KB ok
23 Correct 1 ms 3932 KB ok
24 Correct 1 ms 3932 KB ok
25 Correct 1 ms 3932 KB ok
26 Correct 1 ms 3932 KB ok
27 Correct 1 ms 3932 KB ok
28 Correct 1 ms 3932 KB ok
29 Correct 1 ms 3932 KB ok
30 Correct 1 ms 3932 KB ok
31 Correct 1 ms 3932 KB ok
32 Correct 1 ms 3932 KB ok
33 Correct 1 ms 3932 KB ok
34 Correct 1 ms 3932 KB ok
35 Correct 2 ms 3932 KB ok
36 Correct 1 ms 3932 KB ok
37 Correct 1 ms 3932 KB ok
38 Correct 1 ms 3932 KB ok
39 Correct 2 ms 3928 KB ok
40 Correct 2 ms 3932 KB ok
41 Correct 1 ms 3932 KB ok
42 Correct 1 ms 3932 KB ok
43 Correct 1 ms 3932 KB ok
44 Correct 1 ms 3932 KB ok
45 Correct 2 ms 3932 KB ok
46 Correct 2 ms 3932 KB ok
47 Partially correct 13 ms 2904 KB partial
48 Partially correct 13 ms 2908 KB partial
49 Partially correct 17 ms 2908 KB partial
50 Partially correct 13 ms 2908 KB partial
51 Partially correct 13 ms 2908 KB partial
52 Partially correct 13 ms 2908 KB partial
53 Correct 13 ms 2904 KB ok
54 Partially correct 13 ms 2908 KB partial
55 Partially correct 13 ms 2908 KB partial
56 Partially correct 14 ms 2908 KB partial
57 Partially correct 13 ms 2908 KB partial
58 Partially correct 14 ms 2908 KB partial
59 Partially correct 13 ms 2828 KB partial
60 Partially correct 13 ms 2908 KB partial
61 Partially correct 13 ms 2904 KB partial
62 Partially correct 13 ms 2700 KB partial
63 Partially correct 13 ms 2908 KB partial
64 Partially correct 13 ms 2908 KB partial
65 Partially correct 218 ms 39700 KB partial
66 Partially correct 247 ms 39508 KB partial
67 Partially correct 226 ms 39584 KB partial
68 Partially correct 229 ms 39504 KB partial
69 Partially correct 207 ms 39504 KB partial
70 Partially correct 207 ms 39564 KB partial
71 Partially correct 205 ms 39508 KB partial
72 Partially correct 196 ms 39508 KB partial
73 Correct 199 ms 39668 KB ok
74 Correct 199 ms 39508 KB ok
75 Partially correct 199 ms 39568 KB partial
76 Partially correct 196 ms 39508 KB partial
77 Partially correct 227 ms 39704 KB partial
78 Partially correct 200 ms 39508 KB partial
79 Partially correct 211 ms 39512 KB partial
80 Partially correct 223 ms 39504 KB partial
81 Partially correct 238 ms 39504 KB partial
82 Partially correct 240 ms 39764 KB partial
83 Partially correct 232 ms 39508 KB partial
84 Partially correct 201 ms 39508 KB partial
85 Partially correct 199 ms 39504 KB partial
86 Partially correct 209 ms 39572 KB partial
87 Partially correct 238 ms 39696 KB partial
88 Partially correct 196 ms 39564 KB partial
89 Partially correct 222 ms 38672 KB partial
90 Partially correct 287 ms 39508 KB partial
91 Partially correct 197 ms 39504 KB partial
92 Partially correct 255 ms 39828 KB partial
93 Partially correct 214 ms 39712 KB partial
94 Partially correct 226 ms 39564 KB partial
95 Partially correct 191 ms 39584 KB partial
96 Partially correct 199 ms 39760 KB partial
97 Partially correct 198 ms 39508 KB partial
98 Partially correct 233 ms 39508 KB partial
99 Partially correct 225 ms 39692 KB partial
100 Partially correct 199 ms 39684 KB partial
101 Partially correct 220 ms 39568 KB partial
102 Partially correct 271 ms 39576 KB partial
103 Partially correct 237 ms 39708 KB partial
104 Partially correct 198 ms 39888 KB partial
105 Partially correct 237 ms 39504 KB partial
106 Partially correct 281 ms 39688 KB partial
107 Partially correct 207 ms 39508 KB partial
108 Partially correct 207 ms 39504 KB partial
109 Partially correct 195 ms 39712 KB partial