# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084504 | thangdz2k7 | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 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;
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 (!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;
}
}