#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
using ll = long long;
const int N = 2e5 + 24;
int cnt[N];
void initialize(int n) {
for (int i = 0; i < n; i++) cnt[i] = i;
}
int hasEdge(int u, int v) {
return --cnt[max(u, v)] == 0;
}
#ifdef LOCAL
void solve() {
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int T = 1; // cin >> T;
while (T--) {
solve();
}
}
#endif
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |