oj.uz

Submission #627869

# Submission time Handle Problem Language Result Execution time Memory
627869 2022-08-13T00:25:01 Z Seb Game (IOI14_game) C++17
0 / 100
 1 ms 344 KB 
#include "game.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll p[1505],sz[1505],q[1505];

ll lider(ll a) {
    if (p[a]==a) return a;
    p[a] = lider(p[a]);
    return p[a];
}

void unir(ll a, ll b) {
    if (sz[b]>sz[a]) swap(a,b);
    p[b] = a;
    sz[a] += sz[b];
    q[a] += q[b];
    return;
}

void initialize(int n) {
    ll i;
    for (i=0;i<n;i++) {
        p[i] = i;
        sz[i] = 1;
        q[i] = n-1;
    }
}

int hasEdge(int u, int v) {
    if (q[lider(u)]==1 || q[lider(v)]==1) {
        q[lider(u)]--; q[lider(v)]--;
        unir(lider(u),lider(v));
        return 1;
    }
    else {
        q[lider(u)]--; q[lider(v)]--;
        return 0;
    }
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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