#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int n, tot;
vector<vector<int>> grid;
int biggest_stadium(int N, std::vector<std::vector<int>> F) {
n = N;
grid = F;
if (n == 1) return 1;
tot = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
tot += grid[i][j];
}
}
if (tot == 0) return n * n;
vector<int> l(n), r(n);
for (int i = 0; i < n; i++) {
l[i] = r[i] = -1;
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1) continue;
if (j > 0 && grid[i][j-1] == 1 && l[i] != -1) {
return 0;
}
if (l[i] == -1) l[i] = j;
r[i] = j;
tot++;
}
}
while (l.back() == -1) {
l.pop_back();
r.pop_back();
}
reverse(l.begin(), l.end());
reverse(r.begin(), r.end());
while (l.back() == -1) {
l.pop_back();
r.pop_back();
}
reverse(l.begin(), l.end());
reverse(r.begin(), r.end());
int sz = l.size();
bool canDec = true;
for (int i = 1; i < sz; i++) {
if (l[i] > l[i-1]) {
canDec = false;
}
else {
if (!canDec) return 0;
}
if (l[i] > r[i-1] || r[i] < l[i-1]) return 0;
}
bool canInc = true;
for (int i = 1; i < sz; i++) {
if (r[i] < r[i-1]) {
canInc = false;
}
else {
if (!canInc) return 0;
}
}
for (int i = 0; i < sz; i++) {
if (l[n-1] <= l[i]) continue;
if (r[n-1] > r[i]) return 0;
}
for (int i = 0; i < sz; i++) {
if (r[n-1] >= r[i]) continue;
if (l[n-1] < l[i]) return 0;
}
return tot;
}
