Submission #980118

#TimeUsernameProblemLanguageResultExecution timeMemory
980118vjudge1Soccer Stadium (IOI23_soccer)C++17
6 / 100
228 ms31772 KiB
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define fi first
#define se second

using namespace std;

int biggest_stadium(int N, vector<vector<int>> F){
	int ans=0;
	rep(i,0,N){
		rep(j,0,N){
			if(F[i][j]) ans=max(ans,N*N-min(i+1,N-i)*min(j+1,N-j));
		}
	}
	if(!ans) ans=N*N; 
	return ans;
}
#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...