oj.uz

Submission #14740

# Submission time Handle Problem Language Result Execution time Memory
14740 2015-06-16T03:50:21 Z gs14004 Game (IOI14_game) C++14
0 / 100
 0 ms 18732 KB 
int m;
int cnt[1505][1505];

struct disj{
    int pa[1505], size[1505];
    void init(int n) {
        for(int i=0; i<n; i++) pa[i] = i, size[i] = 1;
    }
    int find(int x){
        return pa[x] = (pa[x] == x ? x : find(pa[x]));
    }
    void uni(int p, int q){
        pa[q] = p;
        size[p] += size[q];
    }
    int get_size(int x){
        return size[find(x)];
    }
}disj;

void initialize(int n){
    m = n;
}

int hasEdge(int u, int v){
    u = disj.find(u);
    v = disj.find(v);
    cnt[u][v]++;
    if(cnt[u][v] == disj.get_size(u) * disj.get_size(v)){
        disj.pa[v] = u;
        disj.size[u] += disj.size[v];
        for (int i=0; i<m; i++) {
            cnt[u][i] += cnt[v][i];
        }
        return 1;
    }
    return 0;
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 18732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 18732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 18732 KB Output isn't correct
2 Halted 0 ms 0 KB -