Submission #1020008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020008		0npata	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	4532 ms	102536 KiB

soccer

#include "soccer.h"

#include<bits/stdc++.h>
using namespace std;

#define vec vector
#define arr array

vec<vec<int>> rotate(vec<vec<int>> f) {
	vec<vec<int>> res = f;
	int n = f.size();

	for(int i = 0; i<n; i++) {
		for(int j = 0; j<n; j++) {
			res[i][j] = f[n-j-1][i];
		}
	}

	return res;
}

vec<vec<int>> rotate_back(vec<vec<int>> f) {
	return rotate(rotate(rotate(f)));
}

vec<vec<int>> solve(vec<vec<int>> f) {
	int n = f.size();

	vec<vec<int>> dp_r_space(n, vec<int>(n, 0));

	for(int i = 1; i<n; i++) {
		for(int j = 0; j<n; j++) {
			if(f[i-1][j] == 1) continue;
			else dp_r_space[i][j] = 1+dp_r_space[i-1][j];
		}
	}

	vec<vec<int>> res(n, vec<int>(n, 0));

	for(int i = 0; i<n; i++) {
		for(int j = 0; j<n; j++) {
			if(f[i][j] == 1) continue;
			res[i][j] = dp_r_space[i][j];
			int cur = dp_r_space[i][j];
			for(int k = j+1; k<n; k++) {
				if(f[i][k] == 1) break;
				cur = min(cur, dp_r_space[i][k]);
				res[i][j] += cur;
			}
		}
	}

	return res;
}

int biggest_stadium(int n, vec<vec<int>> f)
{
	arr<vec<vec<int>>, 4> res;

	res[0] = solve(f);
	f = rotate(f);
	res[1] = rotate_back(solve(f));
	f = rotate(f);
	res[2] = rotate(rotate(solve(f)));
	f = rotate(f);
	res[3] = rotate(solve(f));

	int ans = 0;
	for(int i = 0; i<n; i++) {
		for(int j = 0; j<n; j++) {
			int sum = 0;
			for(int k = 0; k<4; k++) sum += res[k][i][j];
			ans = max(ans, sum);
		}
	}


	return ans+1;
}

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