#include <bits/stdc++.h>
#include "soccer.h"
#define ar array
#define ll long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
int biggest_stadium(int n, std::vector<std::vector<int>> F)
{
vector<ar<int, 2>> ints(n);
int L = -1, R = -1;
for (int i = 0; i < n; i++) {
int u = 0;
for (int j = 0; j < n; j++) if (!F[i][j]) {
int r = j;
while (r+1 < n && !F[i][r+1]) r++;
ints[i] = {j, r};
if (++u == 2) return 0;
j = r;
}
if (u) {
if (!~L) L = i;
else {
if (R != i-1) return 0;
}
R = i;
}
}
int len = -1, idx = -1;
for (int i = L; i <= R; i++) {
if (ckmax(len, ints[i][1] - ints[i][0])) idx = i;
}
for (int i = idx-1; i >= L; i--) {
if (!(ints[i][0] >= ints[i+1][0] && ints[i][1] <= ints[i+1][1])) {
return 0;
}
}
for (int i = idx+1; i <= R; i++) {
if (!(ints[i][0] >= ints[i-1][0] && ints[i][1] <= ints[i-1][1])) {
return 0;
}
}
auto [L1, R1] = ints[L];
auto [L2, R2] = ints[R];
if (L1 > L2 || (L1 == L2 && R1 < R2)) swap(L1, L2), swap(R1, R2);
if (L < idx && R > idx && R1 < R2) return 0;
int tot = 0;
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) tot += !F[i][j];
return tot;
}
