# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980171 | vjudge1 | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;
int n;
int biggest_stadium(int N, std::vector<std::vector<int>> F){
n=N;
int p1=-1, p2=-1;
int ans=0;
for(int i=0; i<n && p1==-1; i++){
for(int j=0; j<n; j++){
if(F[i][j]==1){
p1=i;
p2=j;
break;
}
}
}
ans=max(ans, n*n-(n-p1)*(n-p2));
ans=max(ans, n*n-(p1+1)*(n-p2));
ans= max(ans, n*n-(p1+1)*(p2+1));
ans= max(ans, n*n-(n-p1)*(p2+1))
return 0;
}