제출 #587759

#제출 시각아이디문제언어결과실행 시간메모리
587759FatihSolak게임 (IOI14_game)C++17
0 / 100
1 ms312 KiB
#include "game.h"
#include <bits/stdc++.h>
#define N 1505
using namespace std;
int par[N];
int out[N];
int find(int a){
    if(a == par[a])return a;
    return par[a] = find(par[a]);
}
void initialize(int n) {
    for(int i = 0;i<n;i++){
        par[i] = i;
        out[i] = n-1;
    }
}

int hasEdge(int u, int v) {
    u = find(u);
    v = find(v);
    if(u == v)return 1;
    out[u]--;
    out[v]--;
    if(out[u] == 0 || out[v] == 0){
        par[v] = u;
        out[u] += out[v];
        return 1;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...