# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084510 | 2024-09-06T10:50:04 Z | thangdz2k7 | Soccer Stadium (IOI23_soccer) | C++17 | 204 ms | 39576 KB |
// author : thembululquaUwU // 3.9.2024 #include <bits/stdc++.h> #define pb push_back #define fi first #define se second #define endl '\n' using namespace std; using ll = long long; using ii = pair <int, int>; using vi = vector <int>; const int MaxN = 2e5; const int mod = 1e9 + 7; void maxl(auto &a, auto b) {a = max(a, b);} void minl(auto &a, auto b) {a = min(a, b);} int biggest_stadium(int n, vector <vi> f){ // if (n > 30){ int ans = 0; vi l(n, -1), r(n, -1); int st = -1, ed = n; for (int i = 0; i < n; ++ i){ bool have = false; int nt = 0; for (int j = 0; j < n; ++ j) if (!f[i][j]){ if (l[i] == -1) l[i] = j; r[i] = j; ++ ans; have = true; if (st == -1) st = i; if (i > ed) return 0; if (nt) return 0; } else if (l[i] != -1) nt = 1; if (!have) ed = i; } for (int i = st; i < ed; ++ i){ for (int j = i + 1; j < ed; ++ j){ if (l[i] <= l[j] && r[j] <= r[i]) continue; if (l[j] <= l[i] && r[i] <= r[j]) continue; return 0; } } return ans; //} }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 344 KB | partial |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | ok |
2 | Correct | 0 ms | 348 KB | ok |
3 | Correct | 0 ms | 384 KB | ok |
4 | Correct | 0 ms | 344 KB | ok |
5 | Correct | 1 ms | 348 KB | ok |
6 | Partially correct | 0 ms | 348 KB | partial |
7 | Partially correct | 1 ms | 348 KB | partial |
8 | Partially correct | 15 ms | 2696 KB | partial |
9 | Partially correct | 204 ms | 39576 KB | partial |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | ok |
2 | Correct | 0 ms | 348 KB | ok |
3 | Partially correct | 0 ms | 348 KB | partial |
4 | Incorrect | 1 ms | 348 KB | wrong |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 344 KB | partial |
2 | Correct | 0 ms | 344 KB | ok |
3 | Correct | 0 ms | 348 KB | ok |
4 | Partially correct | 0 ms | 348 KB | partial |
5 | Incorrect | 1 ms | 348 KB | wrong |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 344 KB | partial |
2 | Correct | 0 ms | 344 KB | ok |
3 | Correct | 0 ms | 348 KB | ok |
4 | Correct | 0 ms | 384 KB | ok |
5 | Correct | 0 ms | 344 KB | ok |
6 | Partially correct | 0 ms | 348 KB | partial |
7 | Incorrect | 1 ms | 348 KB | wrong |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 344 KB | partial |
2 | Correct | 0 ms | 344 KB | ok |
3 | Correct | 0 ms | 348 KB | ok |
4 | Correct | 0 ms | 384 KB | ok |
5 | Correct | 0 ms | 344 KB | ok |
6 | Partially correct | 0 ms | 348 KB | partial |
7 | Incorrect | 1 ms | 348 KB | wrong |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 344 KB | partial |
2 | Correct | 0 ms | 344 KB | ok |
3 | Correct | 0 ms | 348 KB | ok |
4 | Correct | 0 ms | 384 KB | ok |
5 | Correct | 0 ms | 344 KB | ok |
6 | Correct | 1 ms | 348 KB | ok |
7 | Partially correct | 0 ms | 348 KB | partial |
8 | Partially correct | 1 ms | 348 KB | partial |
9 | Partially correct | 15 ms | 2696 KB | partial |
10 | Partially correct | 204 ms | 39576 KB | partial |
11 | Partially correct | 0 ms | 348 KB | partial |
12 | Incorrect | 1 ms | 348 KB | wrong |
13 | Halted | 0 ms | 0 KB | - |