#include<iostream>
#include<vector>
#include<algorithm>
#include "soccer.h"
using namespace std;
const int MAX_N=2e3+3;
int a[MAX_N][MAX_N];
int n;
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
n=N;
int rb,cb;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
a[i][j]=F[i][j];
if(a[i][j]==1)
{
rb=i;
cb=j;
}
}
}
int mi=1e9;
mi=min(mi,(n-cb)*(rb+1));
mi=min(mi,(n-cb)*(n-rb));
mi=min(mi,(cb+1)*(n-rb));
mi=min(mi,(cb+1)*(rb+1));
return n*n-mi;
}
| # | 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... |