제출 #776284

#제출 시각아이디문제언어결과실행 시간메모리
776284benjaminkleynGame (IOI14_game)C++17
0 / 100
1 ms212 KiB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

int e[1500];
int find(int u)
{
    return e[u] < 0 ? u : e[u] = find(e[u]);
}
bool unite(int u, int v)
{
    u = find(u), v = find(v);
    if (u == v) return false;
    if (e[u] > e[v]) swap(u, v);
    e[u] += e[v], e[v] = u;
    return true;
}
void initialize(int n)
{
    for (int i = 0; i < n; i++)
        e[i] = -1;
}
int hasEdge(int u, int v)
{
    return unite(u, v);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...