| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 14666 | gs14004 | 게임 (IOI14_game) | C++14 | 0 ms | 9884 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.
int pa[1505];
int cnt[1505];
int m;
int find(int x){
return pa[x] = (pa[x] == x ? x : find(pa[x]));
}
void initialize(int n){
m = n;
for(int i=0; i<=n; i++) pa[i] = i;
}
int hasEdge(int u, int v){
cnt[u]++;
cnt[v]++;
if(cnt[u] == m-1 || cnt[v] == m-1){
if(find(u) != find(v)){
pa[u] = v;
return 0;
}
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... | ||||
