oj.uz

Submission #14667

# Submission time Handle Problem Language Result Execution time Memory
14667 2015-05-30T08:06:48 Z gs14004 Game (IOI14_game) C++14
0 / 100
 0 ms 9884 KB 
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;
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9884 KB Output is correct
2 Correct 0 ms 9884 KB Output is correct
3 Correct 0 ms 9884 KB Output is correct
4 Incorrect 0 ms 9884 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9884 KB Output is correct
2 Correct 0 ms 9884 KB Output is correct
3 Correct 0 ms 9884 KB Output is correct
4 Incorrect 0 ms 9884 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9884 KB Output is correct
2 Correct 0 ms 9884 KB Output is correct
3 Correct 0 ms 9884 KB Output is correct
4 Incorrect 0 ms 9884 KB Output isn't correct
5 Halted 0 ms 0 KB -