oj.uz

답안 #1065221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065221 2024-08-19T03:48:09 Z Gromp15 축구 경기장 (IOI23_soccer) C++17
1.5 / 100
 207 ms 39704 KB 
#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 (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 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 12 ms 2688 KB partial
9 Partially correct 207 ms 39704 KB partial

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 1 ms 348 KB partial
4 Partially correct 1 ms 348 KB partial
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 1 ms 348 KB partial
5 Partially correct 1 ms 348 KB partial
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 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 Partially correct 1 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 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 Partially correct 1 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 1 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 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 12 ms 2688 KB partial
10 Partially correct 207 ms 39704 KB partial
11 Partially correct 1 ms 348 KB partial
12 Partially correct 1 ms 348 KB partial
13 Incorrect 0 ms 348 KB wrong
14 Halted 0 ms 0 KB -