#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2020;
int n;
int f[N][N];
int biggest_stadium(int NN, vector<vector<int>> F) {
n = NN;
int empty_cell = 0;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= n;j++) {
f[i][j] = F[i - 1][j - 1];
empty_cell += f[i][j] == 0;
}
}
{ // check if all empty cell are regular stadium
bool ch = 1;
for (int i = 1;i <= n;i++) {
int cnt = 0;
for (int j = 2;j <= n;j++) {
cnt += f[i - 1][j] != f[i][j];
}
if (cnt > 2) ch = 0;
}
for (int j = 1;j <= n;j++) {
int cnt = 0;
for (int i = 2;i <= n;i++) {
cnt += f[i - 1][j] != f[i][j];
}
if (cnt > 2) ch = 0;
}
if (ch) return empty_cell;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
ok |
2 |
Correct |
1 ms |
344 KB |
ok |
3 |
Correct |
0 ms |
348 KB |
ok |
4 |
Correct |
0 ms |
348 KB |
ok |
5 |
Correct |
0 ms |
348 KB |
ok |
6 |
Incorrect |
1 ms |
444 KB |
wrong |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
ok |
2 |
Correct |
1 ms |
344 KB |
ok |
3 |
Incorrect |
1 ms |
344 KB |
wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
wrong |
2 |
Halted |
0 ms |
0 KB |
- |