Submission #995794

#	Time	Username	Problem	Language	Result	Execution time	Memory
995794		aaaaaarroz	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	191 ms	31788 KiB

soccer

#include <bits/stdc++.h>
using namespace std;
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))+min((arbol.first+1),(arbol.second+1));
		int b=(((arbol.first+1)*(N-arbol.second))+min((arbol.first+1),(N-arbol.second)));
		int c=(((N-arbol.first)*(arbol.second+1))+min((N-arbol.first),(arbol.second+1)));
		int d=(((N-arbol.first)*(N-arbol.second))+min((N-arbol.first),(N-arbol.second)));
		int e=((arbol.first+1)*(arbol.second+1));
		int f=(((arbol.first+1)*(N-arbol.second)));
		int g=(((N-arbol.first)*(arbol.second+1)));
		int h=(((N-arbol.first)*(N-arbol.second)));
		int max_rectangle=min(min(a,b),min(c,d));
		max_rectangle=min(max_rectangle,min(min(e,f),min(g,h)));
		return (N*N)-max_rectangle;
	}
}

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