Submission #995758

#TimeUsernameProblemLanguageResultExecution timeMemory
995758aaaaaarrozSoccer Stadium (IOI23_soccer)C++17
1.50 / 100
204 ms39508 KiB
#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 si_hay_arbol=false;
	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++;
			}
			else{
				arbol={i,j};
				si_hay_arbol=true;
			}
		}
	}
	if(!si_hay_arbol){
		return N*N;
	}
	else{
		int a=(((arbol.first+1)*(arbol.second+1))-1);
		int b=(((arbol.first+1)*(N-arbol.second))-1);
		int c=(((N-arbol.first)*(arbol.second+1))-1);
		int d=(((N-arbol.first)*(N-arbol.second))-1);
		return max(max(a,b),max(c,d));
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...