Submission #995778

#	Time	Username	Problem	Language	Result	Execution time	Memory
995778		aaaaaarroz	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	4546 ms	344 KiB

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){
	if(N>30){
		int empty_cells=0;
		bool posible=true;
		int dx[]={1,0,-1,0};
		int dy[]={0,1,0,-1};
		for(int i=0;i<N;i++){
			for(int j=0;j<N;j++){
				if(F[i][j]==0){
					empty_cells++;
				}
				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;
					}
				}
			}
		}
		return posible==true?empty_cells:1;
	}
	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,-1));
			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((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
• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30