#include <iostream>
#include <vector>
using namespace std;
int fin;
int biggest_stadium(int n, vector<vector<int>> f){
int r,c;
r=-1;
c=-1;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(f[i][j]==1){
r=i;
c=j;
}
}
}
r = min(r, n-1-r);
c = min(c, n-1-c);
fin = n*n;
fin -= (r+1)*(c+1);
return fin;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |