Submission #995757

#	Time	Username	Problem	Language	Result	Execution time	Memory
995757		aaaaaarroz	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	0 ms	348 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 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*arbol.second)-1);
		int b=((arbol.first*(N-arbol.second+1))-1);
		int c=(((N-arbol.first+1)*arbol.second)-1);
		int d=(((N-arbol.first+1)*(N-arbol.second+1))-1);
		return max(max(a,b),max(c,d));
	}
}

• 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