답안 #842366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
842366	2023-09-02T19:21:11 Z	allin27x	축구 경기장 (IOI23_soccer)	C++17	14 / 100	236 ms	47388 KB

soccer

#include <bits/stdc++.h>
using namespace std;

int TestCase1(int n, vector<vector<int>> a){
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			if (!a[i][j]) continue;
			int h = min(i+1, n-i);
			int v = min(j+1, n-j);
			return n*n-h*v;
		}
	}
	return n*n;
}

int TestCase2(int n, vector<vector<int>> a1){	
	int ans = 1;
	auto a = a1;
	for (int cd = 0; cd<(1<<(n*n)); cd++){
		a = a1;
		int bad = 0;
		for (int i=0; i<n; i++) for (int j=0; j<n; j++) 
			if (a[i][j] && !(cd&(1<<(n*i+j)))) bad = 1;
		if (bad) continue;
		for (int i=0; i<n; i++) for (int j=0; j<n; j++) a[i][j] = (bool) (cd & (1<<(n*i+j)));
		for (int x1 = 0; x1<n; x1++) for (int y1 = 0; y1<n; y1++){
			if (a[x1][y1]) continue;
			for (int x2 = 0; x2<n; x2++) for (int y2 = 0; y2<n; y2++){
				if (a[x2][y2]) continue;
				if (x1==x2 && y1==y2) continue;
				if (x1 == x2){
					for (int j=min(y1,y2); j<max(y1,y2); j ++){
						if (a[x1][j]) bad = 1;
					}
				}
				if (y1 == y2){
					for (int i=min(x1,x2); i<max(x1,x2); i++){
						if (a[i][y1]) bad =1;
					}
				}
				if (a[x1][y2] && a[x2][y1]) bad = 1;
				if (bad) break;
			}
			if (bad) break;
		}
		if (bad) continue;
		ans = max(ans, n*n - __builtin_popcount(cd));
	}
	return ans;
}

int Partial(int n, vector<vector<int>> a){
	vector<int> left(n,-1), right(n,-1);
	int cnt = 0;
	for (int i=0; i<n; i++){
		int st = 0;
		for (int j=0; j<n; j++){
			cnt+=!a[i][j];
			if (!a[i][j] && !st){
				st = 1; left[i] = j; right[i]=j;
			} else if (!a[i][j] && st==1){
				right[i] = j;
			} else if (a[i][j] && st==1){
				st = 2;
			} else if (a[i][j] && !st) {}
			else if (a[i][j] && st==2) {}
			else return -1;
		}
	}
	for (int i=0; i<n-1; i++){
		int d = 0;
		int l1=left[i], r1=right[i], l2=left[i+1], r2=right[i+1];
		if (l2==-1) continue;
		if (l1==-1){
			if (d) return -1;
			continue;
		}
		if (l1<l2 && r1<r2) return -1;
		if (l1>l2 && r1>r2) return -1;
		if ((l1>l2 || r1>r2) && !d) d=1;
		else if ((l1<l2 || r1<r2) && d) return -1;
	}
	return cnt;
}

int biggest_stadium(int n, vector<vector<int>> a){
	if (n<4) return TestCase2(n,a);
	int ones = 0;
	for(int i=0; i<n; i++) for (int j=0; j<n; j++) ones+=a[i][j];
	if (ones<=1) return TestCase1(n,a);
	return Partial(n,a);
}

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	Correct	1 ms	348 KB	ok
7	Correct	1 ms	348 KB	ok
8	Correct	15 ms	3228 KB	ok
9	Correct	236 ms	47388 KB	ok

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	Correct	0 ms	348 KB	ok
7	Correct	0 ms	348 KB	ok
8	Correct	0 ms	344 KB	ok
9	Correct	0 ms	348 KB	ok
10	Correct	0 ms	344 KB	ok
11	Correct	0 ms	344 KB	ok
12	Correct	0 ms	348 KB	ok
13	Correct	1 ms	348 KB	ok

Subtask #3
0.0 / 22.0

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

답안 #842366

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 6.0 / 6.0

Subtask #2 8.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
6.0 / 6.0

Subtask #2
8.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