#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
bool checkIntervals(pair<int,int> a, pair<int,int> b)
{
return (b.first <= a.first && a.second <= b.second);
}
bool isGood(int N, vector<vector<int>>& F)
{
vector<pair<int,int>> intervals;
for(int i = 0 ; i < N ; i++)
{
int numCells = 0;
int minCell = N, maxCell = -1;
for(int j = 0 ; j < N ; j++)
{
if( F[i][j] == 0 )
{
numCells++;
minCell = min( minCell , j );
maxCell = max( maxCell , j );
}
}
if( numCells == 0 )
continue;
if( numCells != maxCell - minCell + 1 )
return false;
intervals.push_back( { minCell , maxCell } );
}
sort( intervals.begin() , intervals.end() , [&](pair<int,int> a, pair<int,int> b){
return a.second - a.first + 1 < b.second - b.first + 1;
});
for(int i = 0 ; i + 1 < (int)intervals.size() ; i++)
if( !checkIntervals( intervals[i] , intervals[i + 1] ) ) return false;
return true;
}
int biggest_stadium(int N, vector<vector<int>> F)
{
if( !isGood(N, F) )
return -1;
for(int i = 0 ; i < N ; i++)
for(int j = 0 ; j < i ; j++)
swap( F[i][j] , F[j][i] );
if( !isGood(N, F) )
return -1;
int sum = 0;
for(int i = 0 ; i < N ; i++)
for(int j = 0 ; j < N ; j++)
sum += 1 - F[i][j];
return sum;
}
