oj.uz

Submission #963171

# Submission time Handle Problem Language Result Execution time Memory
963171 2024-04-14T16:11:34 Z MuntherCarrot Game (IOI14_game) C++14
0 / 100
 1 ms 444 KB 
#include <bits/stdc++.h>
#include "game.h"

using namespace std;

const int MAXN = 1505;
int fth[MAXN];

int find(int u){
    return u == fth[u] ? u : fth[u] = find(fth[u]);
}

void merge(int u, int v){
    u = find(u);
    v = find(v);
    fth[v] = u;
}

void initialize(int n){
    iota(fth, fth + MAXN, 0);
}

int hasEdge(int u, int v){
    if(find(u) == find(v)){
        return 0;
    }
    merge(u, v);
    return 1;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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