Submission #587757

#	Time	Username	Problem	Language	Result	Execution time	Memory
587757		FatihSolak	Game (IOI14_game)	C++17	0 / 100	1 ms	308 KiB

game

#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[v] += out[u];
        return 1;
    }
    return 0;
}

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