oj.uz

Submission #995761

# Submission time Handle Problem Language Result Execution time Memory
995761 2024-06-09T21:43:08 Z aaaaaarroz Soccer Stadium (IOI23_soccer) C++17
0 / 100
 1 ms 348 KB 
#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;
	bool posible=true;
	int dx[]={1,0,-1,0};
	int dy[]={0,1,0,-1};
	pair<int,int>libre;
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(F[i][j]==0){
				empty_cells++;
				libre={i,j};
			}
			else{
				int grado=0;
				for(int ii=0;ii<4;ii++){
					if(limites(N,i+dx[ii],j+dy[ii])){
						if(F[i+dx[ii]][j+dy[ii]]==0){
							grado++;
						}
					}
				}
				if(grado==3){
					posible=false;
				}
			}
		}
	}
	queue<pair<int,int>>cola;
	vector<vector<bool>>v(N,vector<bool>(N));
	v[libre.first][libre.second]=true;
	cola.push(libre);
	while(!cola.empty()){
		auto[i,j]=cola.front();
		cola.pop();
		for(int ii=0;ii<4;ii++){
			if(limites(N,i+dx[ii],j+dy[ii])){
				if(F[i+dx[ii]][j+dy[ii]]==0&&!v[i+dx[ii]][j+dy[ii]]){
					v[i+dx[ii]][j+dy[ii]]=true;
					cola.push({i+dx[ii],j+dy[ii]});
				}
			}
		}
	}
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(F[i][j]==0&&!v[i][j]){
				posible=false;
			}
			
		}
	}
	return posible==true?empty_cells:1;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 344 KB partial
4 Partially correct 0 ms 348 KB partial
5 Incorrect 1 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory 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 Partially correct 0 ms 344 KB partial
5 Partially correct 0 ms 348 KB partial
6 Incorrect 1 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory 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 Partially correct 0 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Incorrect 1 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory 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 Partially correct 0 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Incorrect 1 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB wrong
8 Halted 0 ms 0 KB -