oj.uz

Submission #1042939

# Submission time Handle Problem Language Result Execution time Memory
1042939 2024-08-03T15:10:54 Z 42kangaroo Soccer Stadium (IOI23_soccer) C++17
29.5 / 100
 695 ms 1006164 KB 
#include "soccer.h"
#include "bits/stdc++.h"


int biggest_stadium(int N, std::vector<std::vector<int>> F) {
	using namespace std;
	using dp_t = vector<vector<vector<int>>>;
	bool allPos = true;
	int su = 0;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			su += F[i][j];
		}
	}
	if (su == 1) {
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < N; ++j) {
				if (F[i][j] == 1) {
					return N * N - min(i + 1, N - i) * min(j + 1, N - j);
				}
			}
		}
	} else {
		vector<pair<int, int>> ra(N);
		vector<int> les(N);
		for (int i = 0; i < N; ++i) {
			ra[i].first = 0;
			for (; ra[i].first < N; ra[i].first++) {
				if (F[i][ra[i].first] == 0) break;
			}
			ra[i].second = N - 1;
			for (; ra[i].second >= 0; ra[i].second--) {
				if (F[i][ra[i].second] == 0) break;
			}
			les[i] = ra[i].second - ra[i].first + 1;
			for (int j = ra[i].first; j <= ra[i].second; ++j) {
				if (F[i][j] == 1) allPos = false;
			}
			if (!allPos) break;
		}
		int tot = 0;
		int maI = max_element(les.begin(), les.end()) - les.begin();
		pair<int, int> actRa = ra[maI];
		pair<int, int> oRa = {maI, maI};
		tot = les[maI];
		while (allPos && oRa != make_pair(0, N - 1)) {
			int ne = oRa.first - 1;
			if (ne < 0 || (oRa.second < N - 1 && les[ne] < les[oRa.second + 1])) ne = oRa.second + 1;
			if (les[ne] < 0) break;
			if (actRa.first > ra[ne].first || actRa.second < ra[ne].second) allPos = false;
			actRa = ra[ne];
			tot += les[ne];
			oRa = {min(oRa.first, ne), max(oRa.second, ne)};
		}
		if (allPos) return tot;
		else if (N > 500) return 0;
		else {
			vector<vector<int>> prefS(N, vector<int>(N + 1, 0));
			for (int i = 0; i < N; ++i) {
				for (int j = 0; j < N; ++j) {
					prefS[i][j + 1] = prefS[i][j] + F[i][j];
				}
			}
			dp_t dpU(N + 1, vector<vector<int>>(N + 1, vector<int>(N + 1, -N * N)));
			auto dpD = dpU;
			int ma = 0;
			for (int i = 0; i <= N; ++i) {
				for (int j = N - 1; j >= 0; --j) {
					for (int k = j + 1; k <= N; ++k) {
						if (i == 0)dpU[0][j][k] = 0;
						else if (prefS[i - 1][k] - prefS[i - 1][j] == 0) dpU[i][j][k] = dpU[i - 1][j][k] + k - j;
						else dpU[i][j][k] = max(dpU[i][j][k - 1], dpU[i][j + 1][k]);
					}
				}
			}
			for (int i = N; i >= 0; --i) {
				for (int j = N - 1; j >= 0; --j) {
					for (int k = j + 1; k <= N; ++k) {
						if (i == N) dpD[N][j][k] = 0;
						else if (prefS[i][k] - prefS[i][j] == 0) {
							dpD[i][j][k] = dpD[i + 1][j][k] + k - j;
							ma = max(ma, dpD[i][j][k] + dpU[i + 1][j][k]);
						}
						else dpD[i][j][k] = max(dpD[i][j][k - 1], dpD[i][j + 1][k]);
					}
				}
			}
			return ma;
		}
	}
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:91:1: warning: control reaches end of non-void function [-Wreturn-type]
   91 | }
      | ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 11 ms 2904 KB ok
9 Correct 168 ms 35132 KB ok

Subtask #2
2.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 344 KB ok
12 Partially correct 0 ms 348 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 348 KB partial
12 Correct 0 ms 344 KB ok
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 432 KB partial
19 Partially correct 1 ms 344 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 1 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial

Subtask #4
4.5 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 344 KB ok
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 432 KB partial
21 Partially correct 1 ms 344 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 604 KB partial
31 Partially correct 1 ms 604 KB partial
32 Partially correct 0 ms 604 KB partial
33 Partially correct 1 ms 604 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 1 ms 604 KB partial
37 Partially correct 0 ms 604 KB partial
38 Partially correct 0 ms 604 KB partial
39 Partially correct 1 ms 604 KB partial
40 Partially correct 1 ms 604 KB partial
41 Partially correct 1 ms 604 KB partial

Subtask #5
4.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 344 KB ok
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 432 KB partial
21 Partially correct 1 ms 344 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 604 KB partial
31 Partially correct 1 ms 604 KB partial
32 Partially correct 0 ms 604 KB partial
33 Partially correct 1 ms 604 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 1 ms 604 KB partial
37 Partially correct 0 ms 604 KB partial
38 Partially correct 0 ms 604 KB partial
39 Partially correct 1 ms 604 KB partial
40 Partially correct 1 ms 604 KB partial
41 Partially correct 1 ms 604 KB partial
42 Partially correct 633 ms 1006160 KB partial
43 Partially correct 631 ms 1006164 KB partial
44 Partially correct 695 ms 1006164 KB partial
45 Partially correct 631 ms 1005960 KB partial
46 Partially correct 619 ms 1005872 KB partial
47 Partially correct 651 ms 1005836 KB partial
48 Correct 12 ms 2824 KB ok
49 Partially correct 607 ms 1005904 KB partial
50 Partially correct 651 ms 1005716 KB partial
51 Partially correct 614 ms 1005812 KB partial
52 Partially correct 605 ms 1006032 KB partial
53 Partially correct 637 ms 1005808 KB partial
54 Partially correct 636 ms 1005792 KB partial
55 Partially correct 626 ms 1005908 KB partial
56 Partially correct 609 ms 1005908 KB partial
57 Partially correct 624 ms 1005868 KB partial
58 Partially correct 615 ms 1005964 KB partial
59 Partially correct 632 ms 1006164 KB partial

Subtask #6
7.5 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 11 ms 2904 KB ok
10 Correct 168 ms 35132 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 348 KB ok
18 Partially correct 0 ms 348 KB partial
19 Correct 0 ms 344 KB ok
20 Partially correct 0 ms 348 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 432 KB partial
26 Partially correct 1 ms 344 KB partial
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 348 KB ok
29 Partially correct 0 ms 348 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 604 KB partial
36 Partially correct 1 ms 604 KB partial
37 Partially correct 0 ms 604 KB partial
38 Partially correct 1 ms 604 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 0 ms 348 KB ok
41 Partially correct 1 ms 604 KB partial
42 Partially correct 0 ms 604 KB partial
43 Partially correct 0 ms 604 KB partial
44 Partially correct 1 ms 604 KB partial
45 Partially correct 1 ms 604 KB partial
46 Partially correct 1 ms 604 KB partial
47 Partially correct 633 ms 1006160 KB partial
48 Partially correct 631 ms 1006164 KB partial
49 Partially correct 695 ms 1006164 KB partial
50 Partially correct 631 ms 1005960 KB partial
51 Partially correct 619 ms 1005872 KB partial
52 Partially correct 651 ms 1005836 KB partial
53 Correct 12 ms 2824 KB ok
54 Partially correct 607 ms 1005904 KB partial
55 Partially correct 651 ms 1005716 KB partial
56 Partially correct 614 ms 1005812 KB partial
57 Partially correct 605 ms 1006032 KB partial
58 Partially correct 637 ms 1005808 KB partial
59 Partially correct 636 ms 1005792 KB partial
60 Partially correct 626 ms 1005908 KB partial
61 Partially correct 609 ms 1005908 KB partial
62 Partially correct 624 ms 1005868 KB partial
63 Partially correct 615 ms 1005964 KB partial
64 Partially correct 632 ms 1006164 KB partial
65 Partially correct 180 ms 35672 KB partial
66 Partially correct 186 ms 39760 KB partial
67 Partially correct 175 ms 39508 KB partial
68 Partially correct 187 ms 39760 KB partial
69 Partially correct 178 ms 39504 KB partial
70 Partially correct 171 ms 39504 KB partial
71 Partially correct 173 ms 39576 KB partial
72 Partially correct 169 ms 39708 KB partial
73 Correct 173 ms 39504 KB ok
74 Correct 176 ms 39560 KB ok
75 Partially correct 221 ms 39504 KB partial
76 Partially correct 174 ms 39504 KB partial
77 Partially correct 168 ms 39564 KB partial
78 Partially correct 174 ms 39504 KB partial
79 Partially correct 169 ms 39688 KB partial
80 Partially correct 170 ms 39508 KB partial
81 Partially correct 182 ms 39504 KB partial
82 Partially correct 167 ms 39508 KB partial
83 Partially correct 181 ms 39760 KB partial
84 Partially correct 178 ms 39632 KB partial
85 Partially correct 181 ms 39604 KB partial
86 Partially correct 170 ms 39208 KB partial
87 Partially correct 183 ms 39556 KB partial
88 Partially correct 173 ms 39512 KB partial
89 Partially correct 183 ms 39508 KB partial
90 Partially correct 170 ms 39504 KB partial
91 Partially correct 174 ms 39760 KB partial
92 Partially correct 178 ms 35660 KB partial
93 Partially correct 185 ms 39492 KB partial
94 Partially correct 172 ms 39680 KB partial
95 Partially correct 190 ms 39692 KB partial
96 Partially correct 176 ms 39504 KB partial
97 Partially correct 171 ms 39504 KB partial
98 Partially correct 172 ms 39504 KB partial
99 Partially correct 173 ms 39508 KB partial
100 Partially correct 169 ms 39508 KB partial
101 Partially correct 167 ms 39596 KB partial
102 Partially correct 170 ms 39504 KB partial
103 Partially correct 164 ms 39508 KB partial
104 Partially correct 166 ms 39508 KB partial
105 Partially correct 175 ms 39704 KB partial
106 Partially correct 174 ms 39508 KB partial
107 Partially correct 172 ms 39508 KB partial
108 Partially correct 181 ms 39508 KB partial
109 Partially correct 169 ms 39572 KB partial