Submission #14667

#TimeUsernameProblemLanguageResultExecution timeMemory
14667gs14004게임 (IOI14_game)C++14
0 / 100
0 ms9884 KiB
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 1;
        }
        return 0;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...