답안 #995773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995773	2024-06-09T22:40:45 Z	aaaaaarroz	축구 경기장 (IOI23_soccer)	C++17	12 / 100	4500 ms	9416 KB

soccer

#include <bits/stdc++.h>
using namespace std;
bool limites(int N, int i, int j){
	return i>=0&&i<N&&j>=0&&j<N;
}
int biggest_stadium(int N, vector<vector<int>> F){
	int empty_cells=0;
	pair<int,int>arbol;
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(F[i][j]==0){
				empty_cells++;
			}	
		}
	}
	bool si=true;
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(F[i][j]==1){
				continue;
			}
			priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<tuple<int,int,int>>>cola;
			int dx[]={1,0,-1,0};
			int dy[]={0,1,0,-1};
			vector<vector<int>>dist(N,vector<int>(N,INT_MAX));
			dist[i][j]=0;
			cola.push({0,i,j});
			while(!cola.empty()){
				auto[d,x,y]=cola.top();
				cola.pop();
				for(int dir=0;dir<4;dir++){
					int posi=x+dx[dir];
					int posj=y+dy[dir];
					while(true){
						if(!limites(N,posi,posj)||F[posi][posj]==1)break;
						if((d+1)<dist[posi][posj]){
							dist[posi][posj]=d+1;
							cola.push({dist[posi][posj],posi,posj});
						}
						posi+=dx[dir];
						posj+=dy[dir];
					}
				}
			}
			for(int x=0;x<N;x++){
				for(int y=0;y<N;y++){
					if(F[x][y]==0&&(dist[x][y]>=3||dist[x][y]==-1)){
						si=false;
					}
				}
			}
			if(!si){
				break;
			}
		}
		if(!si){
			break;
		}
	}
	if(si){
		return empty_cells;
	}
	else{
		return 1;
	}
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

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

Subtask #2
2.0 / 8.0

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

Subtask #3
5.5 / 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	0 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	344 KB	partial
8	Partially correct	0 ms	348 KB	partial
9	Correct	0 ms	348 KB	ok
10	Correct	0 ms	344 KB	ok
11	Partially correct	0 ms	348 KB	partial
12	Partially correct	0 ms	348 KB	partial
13	Partially correct	0 ms	348 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	0 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	1 ms	344 KB	partial
24	Partially correct	0 ms	348 KB	partial
25	Partially correct	0 ms	348 KB	partial
26	Partially correct	0 ms	600 KB	partial

Subtask #4
4.5 / 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	1 ms	440 KB	ok
5	Correct	2 ms	348 KB	ok
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	Partially correct	0 ms	344 KB	partial
10	Partially correct	0 ms	348 KB	partial
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	344 KB	ok
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	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	0 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	1 ms	344 KB	partial
26	Partially correct	0 ms	348 KB	partial
27	Partially correct	0 ms	348 KB	partial
28	Partially correct	0 ms	600 KB	partial
29	Partially correct	0 ms	344 KB	partial
30	Partially correct	0 ms	348 KB	partial
31	Partially correct	0 ms	348 KB	partial
32	Partially correct	0 ms	348 KB	partial
33	Partially correct	0 ms	348 KB	partial
34	Correct	3 ms	348 KB	ok
35	Correct	13 ms	448 KB	ok
36	Partially correct	1 ms	348 KB	partial
37	Partially correct	1 ms	348 KB	partial
38	Partially correct	0 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	344 KB	partial
2	Correct	1 ms	348 KB	ok
3	Correct	0 ms	348 KB	ok
4	Correct	1 ms	440 KB	ok
5	Correct	2 ms	348 KB	ok
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	Partially correct	0 ms	344 KB	partial
10	Partially correct	0 ms	348 KB	partial
11	Correct	0 ms	348 KB	ok
12	Correct	0 ms	344 KB	ok
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	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	0 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	1 ms	344 KB	partial
26	Partially correct	0 ms	348 KB	partial
27	Partially correct	0 ms	348 KB	partial
28	Partially correct	0 ms	600 KB	partial
29	Partially correct	0 ms	344 KB	partial
30	Partially correct	0 ms	348 KB	partial
31	Partially correct	0 ms	348 KB	partial
32	Partially correct	0 ms	348 KB	partial
33	Partially correct	0 ms	348 KB	partial
34	Correct	3 ms	348 KB	ok
35	Correct	13 ms	448 KB	ok
36	Partially correct	1 ms	348 KB	partial
37	Partially correct	1 ms	348 KB	partial
38	Partially correct	0 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	75 ms	4376 KB	partial
43	Partially correct	55 ms	4052 KB	partial
44	Partially correct	298 ms	5592 KB	partial
45	Partially correct	449 ms	8180 KB	partial
46	Partially correct	109 ms	4692 KB	partial
47	Partially correct	841 ms	8144 KB	partial
48	Execution timed out	4559 ms	7160 KB	Time limit exceeded
49	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	1 ms	440 KB	ok
5	Correct	2 ms	348 KB	ok
6	Correct	0 ms	348 KB	ok
7	Partially correct	0 ms	344 KB	partial
8	Partially correct	591 ms	876 KB	partial
9	Execution timed out	4542 ms	9416 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

답안 #995773

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 0.0 / 6.0

Subtask #2 2.0 / 8.0

Subtask #3 5.5 / 22.0

Subtask #4 4.5 / 18.0

Subtask #5 0.0 / 16.0

Subtask #6 0.0 / 30.0

Subtask #0
0.0 / 0.0

Subtask #1
0.0 / 6.0

Subtask #2
2.0 / 8.0

Subtask #3
5.5 / 22.0

Subtask #4
4.5 / 18.0

Subtask #5
0.0 / 16.0

Subtask #6
0.0 / 30.0