답안 #1065233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1065233	2024-08-19T04:00:25 Z	Gromp15	축구 경기장 (IOI23_soccer)	C++17	3.5 / 100	193 ms	31828 KB

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 / 0.0

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

Subtask #1
1.5 / 6.0

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

Subtask #2
2.0 / 8.0

#	결과	메모리	Grader output
1	Correct	344 KB	ok
2	Correct	344 KB	ok
3	Partially correct	348 KB	partial
4	Partially correct	344 KB	partial
5	Partially correct	348 KB	partial
6	Partially correct	348 KB	partial
7	Partially correct	348 KB	partial
8	Correct	348 KB	ok
9	Correct	348 KB	ok
10	Partially correct	348 KB	partial
11	Partially correct	348 KB	partial
12	Partially correct	600 KB	partial
13	Correct	348 KB	ok

Subtask #3
0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 KB	ok
4	Partially correct	0 ms	348 KB	partial
5	Partially correct	0 ms	344 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	348 KB	partial
12	Partially correct	0 ms	348 KB	partial
13	Partially correct	0 ms	600 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	344 KB	partial
18	Partially correct	0 ms	348 KB	partial
19	Partially correct	0 ms	348 KB	partial
20	Correct	1 ms	348 KB	ok
21	Correct	0 ms	348 KB	ok
22	Incorrect	0 ms	348 KB	wrong
23	Halted	0 ms	0 KB	-

Subtask #4
0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 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	0 ms	344 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	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	600 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	344 KB	partial
20	Partially correct	0 ms	348 KB	partial
21	Partially correct	0 ms	348 KB	partial
22	Correct	1 ms	348 KB	ok
23	Correct	0 ms	348 KB	ok
24	Incorrect	0 ms	348 KB	wrong
25	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	348 KB	partial
2	Correct	0 ms	344 KB	ok
3	Correct	0 ms	344 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	0 ms	344 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	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	600 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	344 KB	partial
20	Partially correct	0 ms	348 KB	partial
21	Partially correct	0 ms	348 KB	partial
22	Correct	1 ms	348 KB	ok
23	Correct	0 ms	348 KB	ok
24	Incorrect	0 ms	348 KB	wrong
25	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	344 KB	ok
3	Correct	0 ms	344 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	2 ms	348 KB	partial
9	Partially correct	12 ms	2196 KB	partial
10	Partially correct	193 ms	31828 KB	partial
11	Partially correct	0 ms	348 KB	partial
12	Partially correct	0 ms	344 KB	partial
13	Partially correct	0 ms	348 KB	partial
14	Partially correct	0 ms	348 KB	partial
15	Partially correct	0 ms	348 KB	partial
16	Correct	0 ms	348 KB	ok
17	Correct	0 ms	348 KB	ok
18	Partially correct	0 ms	348 KB	partial
19	Partially correct	0 ms	348 KB	partial
20	Partially correct	0 ms	600 KB	partial
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	0 ms	344 KB	partial
25	Partially correct	0 ms	348 KB	partial
26	Partially correct	0 ms	348 KB	partial
27	Correct	1 ms	348 KB	ok
28	Correct	0 ms	348 KB	ok
29	Incorrect	0 ms	348 KB	wrong
30	Halted	0 ms	0 KB	-

답안 #1065233

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 1.5 / 6.0

Subtask #2 2.0 / 8.0

Subtask #3 0.0 / 22.0

Subtask #4 0.0 / 18.0

Subtask #5 0.0 / 16.0

Subtask #6 0.0 / 30.0

Subtask #0
0.0 / 0.0

Subtask #1
1.5 / 6.0

Subtask #2
2.0 / 8.0

Subtask #3
0.0 / 22.0

Subtask #4
0.0 / 18.0

Subtask #5
0.0 / 16.0

Subtask #6
0.0 / 30.0