| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 759218 | Dan4Life | 게임 (IOI14_game) | C++17 | 1 ms | 340 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.
#include <bits/stdc++.h>
using namespace std;
int cnt[1501][1501];
int n, p[1501], s[1501], vis[1501];
int findSet(int i){return i==p[i]?i:p[i]=findSet(p[i]);}
int unionSet(int x, int y){
if(s[x]>s[y]) swap(x,y);
fill(vis,vis+n,0); p[y] = x; s[x]+=s[y];
vis[x]=vis[y]=1;
for(int i = 0; i < n; i++){
int z = findSet(i);
if(vis[z]) continue; vis[z]=1;
cnt[z][x]+=cnt[z][x], cnt[x][z]+=cnt[y][z];
}
return 1;
}
void initialize(int N){
n = N; fill(s,s+n,1); iota(p,p+n,0);
}
int hasEdge(int u, int v){
u = findSet(u), v = findSet(v);
cnt[u][v]++, cnt[v][u]++;
if(cnt[u][v]!=s[u]*s[v]) return 0;
return unionSet(u,v);
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
