#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
ll prefrow[2001][2001];
ll prefcol[2001][2001];
ll grid[2001][2001];
bool checkrow(ll a, ll b, ll row){
if (a>b) swap(a,b);
return (prefrow[row][b] - prefrow[row][a] + grid[row][a] == 0);
}
bool checkcol(ll a, ll b, ll col){
if (a>b) swap(a,b);
return (prefcol[b][col] - prefcol[a][col] + grid[a][col] == 0);
}
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
ll ans = N*N;
FOR(i,0,N){
FOR(j,0,N){
grid[i][j] = F[i][j];
ans -= F[i][j];
}
}
FOR(i,0,N){
prefrow[i][0] = F[i][0];
FOR(j,1,N){
prefrow[i][j] = prefrow[i][j-1] + F[i][j];
}
}
FOR(j,0,N){
prefcol[0][j] = F[0][j];
FOR(i,1,N){
prefcol[i][j] = prefcol[i-1][j] + F[i][j];
}
}
vector<vector<ll>> special;
FOR(i,0,N){
FOR(j,0,N){
vector<vector<ll>> sus = {{i-1,j}, {i+1,j}, {i,j-1}, {i,j+1}};
if (grid[i][j] != 1){
bool flag = 0;
for (auto&k : sus){
if (0<=k[0] && k[0]<N && 0<=k[1] && k[1]<N){
if (grid[k[0]][k[1]]==1) flag = 1;
}
}
if (flag==1 || i==0 || i==N-1 || j==0 || j==N-1) special.push_back({i,j});
}
}
}
for (auto&X : special){
for (auto&Y : special){
ll i = X[0], j = X[1], k = Y[0], l= Y[1];
if (grid[i][j]==1 || grid[k][l] == 1) continue;
bool check1 = (checkrow(l, j, i) && checkcol(k, i, l));
bool check2 = (checkrow(l, j, k) && checkcol(k, i, j));
if (!check1 && !check2) return 0;
}
}
return ans;
}
