제출 #1065227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1065227		Gromp15	축구 경기장 (IOI23_soccer)	C++17	12 / 100	4594 ms	40428 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; }

int biggest_stadium(int n, std::vector<std::vector<int>> F)
{
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) if (!F[i][j]) {
			vector<vector<bool>> vis(n, vector<bool>(n));
			int L = i, R = i;
			while (L && !F[L-1][j]) L--;
			while (R+1 < n && !F[R+1][j]) R++;
			for (int k = L; k <= R; k++) {
				int L2 = j, R2 = j;
				while (L2 && !F[k][L2-1]) L2--;
				while (R2+1 < n && !F[k][R2+1]) R2++;
				for (int l = L2; l <= R2; l++) vis[k][l] = 1;
			}
			L = j, R = j;
			while (L && !F[i][L-1]) L--;
			while (R+1 < n && !F[i][R+1]) R++;
			for (int k = L; k <= R; k++) {
				int L2 = i, R2 = i;
				while (L2 && !F[L2-1][k]) L2--;
				while (R2+1 < n && !F[R2+1][k]) R2++;
				for (int l = L2; l <= R2; l++) vis[l][k] = 1;
			}
			for (int k = 0; k < n; k++) for (int l = 0; l < n; l++) {
				if (!F[k][l] && !vis[k][l]) 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;
	/*
	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;
		}
	}
	auto [L1, R1] = ints[L];
	auto [L2, R2] = ints[R];
	if (min(R1, R2) < min(L1, L2)) 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;
	*/
}

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