제출 #1065233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1065233		Gromp15	Soccer Stadium (IOI23_soccer)	C++17	3.50 / 100	193 ms	31828 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)
{
	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 (L1 > L2 || (L1 == L2 && R1 < R2)) swap(L1, L2), swap(R1, R2);
	if (L < idx && R > idx && 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;
}

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