Submission #835233

#	Time	Username	Problem	Language	Result	Execution time	Memory
835233		Liudas	Game (IOI14_game)	C++17	0 / 100	1 ms	336 KiB

game

#include <iostream>
#include <numeric>
#include <vector>
#include <set>
using namespace std;
vector<set<int>> can;
vector<int> par;
int get(int x){
    if(par[x] != x){
        return par[x] = get(par[x]);
    }
    return x;
}
void merge(int u, int v){
    par[u] = v;
}
void initialize(int N){
    par.resize(N);
    set<int> con;
    for(int i = 0; i < N; i ++){
        con.insert(i);
    }
    can.resize(N);
    for(int i = 0; i < N; i ++){
        con.erase(i);
        can[i] = con;
        con.insert(i);
    }
    iota(par.begin(), par.end(), 0);
}
int hasEdge(int u, int v){
    u = get(u);
    v = get(v);
    if(u == v){return 0;}
    can[u].erase(v);
    can[v].erase(u);
    if(can[u].size() == 0){
        merge(u, v);
        return 1;
    }
    if(can[v].size() == 0){
        merge(v, u);
        return 1;
    }
    return 0;
}

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