Submission #995762

#	Time	Username	Problem	Language	Result	Execution time	Memory
995762		aaaaaarroz	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	184 ms	31828 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){
	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;
}

• Subtask 0: 0 / 0
• Subtask 1: 1.5 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30