Submission #1065249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065249		Gromp15	Soccer Stadium (IOI23_soccer)	C++17	18 / 100	4603 ms	1011800 KiB

soccer

#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 = 505;
int dp[nax][nax][nax][2];
int biggest_stadium(int n, std::vector<std::vector<int>> F)
{
	memset(dp, 0xc0, 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][0] = 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 k = 0; k < 2; k++) if (dp[i][j][l][k] > 0) {
					int r = k ? to[j][l] : to[i][l];
					if (i) {
						for (int z = l; z <= r; z++) if (~to[i-1][z]) {
							if (to[i-1][z] <= r) {
								ckmax(dp[i-1][j][z][0], dp[i][j][l][k] + to[i-1][z] - z + 1);
							}
							else {
								ckmax(dp[i-1][j][z][k], dp[i][j][l][k] + r - z + 1);
							}
						}
					}
					if (j+1 < n) {
						for (int z = l; z <= r; z++) if (~to[j+1][z]) {
							if (to[j+1][z] <= r) {
								ckmax(dp[i][j+1][z][1], dp[i][j][l][k] + to[j+1][z] - z + 1);
							}
							else {
								ckmax(dp[i][j+1][z][k], dp[i][j][l][k] + 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 = 0; l < 2; l++) ckmax(ans, dp[i][j][k][l]);
	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 8 / 8
• Subtask 3: 5.5 / 22
• Subtask 4: 4.5 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30