| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1195374 | mannshah1211 | Soccer Stadium (IOI23_soccer) | C++20 | 188 ms | 31772 KiB |
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int n, vector<vector<int>> f) {
for (int i = 0; i < n; i++) {
int mx = 0, mn = n, cnt = 0;
for (int j = 0; j < n; j++) {
if (f[i][j] == 0) {
mx = max(mx, j);
mn = min(mn, j);
cnt++;
}
}
if (mx - mn + 1 != cnt) {
return 0;
}
}
for (int j = 0; j < n; j++) {
int mx = 0, mn = n, cnt = 0;
for (int i = 0; i < n; i++) {
if (f[i][j] == 0) {
mx = max(mx, i);
mn = min(mn, i);
cnt++;
}
}
if (mx - mn + 1 != cnt) {
return 0;
}
}
int tot = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
tot += (f[i][j] == 0);
}
}
return tot;
}| # | 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... | ||||
