This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "soccer.h"
using namespace std;
int biggest_stadium(int n, vector<vector<int>> f)
{
int cnt = 0;
bool good = 1;
for (int i = 0; i < n; i++){
bool beg = 0;
bool con = 1;
for (int j = 0; j < n; j++){
if (f[i][j]==0){
cnt++;
if (!beg) beg = 1;
else con &= f[i][j-1]==f[i][j];
}
}
if (!con) good = 0;
}
for (int i = 0; i < n; i++){
bool beg = 0;
bool con = 1;
for (int j = 0; j < n; j++){
if (f[j][i]==0){
if (!beg) beg = 1;
else con &= f[j-1][i]==f[j][i];
}
}
if (!con) good = 0;
}
if (good) return cnt;
return -1;
}
| # | 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... |