oj.uz

답안 #1065227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065227 2024-08-19T03:55:21 Z Gromp15 축구 경기장 (IOI23_soccer) C++17
12 / 100
 4500 ms 40428 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)
{
	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 / 0.0

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

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 440 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 600 KB ok
6 Partially correct 1 ms 348 KB partial
7 Partially correct 6 ms 344 KB partial
8 Partially correct 280 ms 2908 KB partial
9 Execution timed out 4594 ms 40428 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 440 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 1 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 344 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 432 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 440 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 1 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 344 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 432 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Correct 0 ms 344 KB ok
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 1 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 440 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 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 432 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 1 ms 348 KB partial
22 Correct 0 ms 344 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 436 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 432 KB ok
35 Correct 2 ms 344 KB ok
36 Partially correct 1 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 440 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 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 344 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 432 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 1 ms 348 KB partial
22 Correct 0 ms 344 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 1 ms 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 436 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 432 KB ok
35 Correct 2 ms 344 KB ok
36 Partially correct 1 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 13 ms 2904 KB partial
43 Partially correct 14 ms 2908 KB partial
44 Partially correct 20 ms 2904 KB partial
45 Partially correct 14 ms 2908 KB partial
46 Partially correct 12 ms 2908 KB partial
47 Partially correct 13 ms 2908 KB partial
48 Execution timed out 4566 ms 2908 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 440 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 600 KB ok
7 Partially correct 1 ms 348 KB partial
8 Partially correct 6 ms 344 KB partial
9 Partially correct 280 ms 2908 KB partial
10 Execution timed out 4594 ms 40428 KB Time limit exceeded
11 Halted 0 ms 0 KB -