Submission #432469

#	Time	Username	Problem	Language	Result	Execution time	Memory
432469		MilosMilutinovic	Game (IOI14_game)	C++14	0 / 100	1 ms	300 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1505;

int parent[MAXN];

int root(int u) {
    return parent[u] ^ u ? parent[u] = root(parent[u]) : u;
}

void unite(int u, int v) {
    u = root(u);
    v = root(v);
    parent[u] = v;
}

int hasEdge(int u, int v) {
    return 1;
}

void initialize(int N) {
    for (int i = 0; i < N; i++)
        parent[i] = i;
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            if (root(i) != root(j))
                if (hasEdge(i, j))
                    unite(i, j);
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58