oj.uz

Submission #72603

# Submission time Handle Problem Language Result Execution time Memory
72603 2018-08-26T11:01:47 Z vex Game (IOI14_game) C++14
0 / 100
 3 ms 468 KB 
#include <bits/stdc++.h>
#define maxn 1505
using namespace std;

int n;
int sz[maxn],p[maxn];
int uk=0;
void initialize(int N)
{
    n=N;
    for(int i=0;i<n;i++)
    {
        sz[i]=1;
        p[i]=i;
    }
}
int fnd(int x)
{
    if(x==p[x])return x;
    return p[x]=fnd(p[x]);
}
int hasEdge(int u,int v)
{
    u=fnd(u);
    v=fnd(v);
    
    if(u==v)return 1;
    if(sz[u]+sz[v]<n)
    {
        if(sz[u]<sz[v])swap(u,v);
        sz[u]+=sz[v];
        p[v]=u;
        return 1;
    }
    return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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