This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1507;
int n, cnt[N], t = 1;
void initialize(int _n){
n = _n;
}
int hasEdge(int u, int v){
cnt[u]++;
cnt[v]++;
if(cnt[u] >= t || cnt[v] >= t){
cnt[u] = cnt[v] = -n;
t++;
return 1;
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |