Submission #1148078

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148078		AlgorithmWarrior	Game (IOI14_game)	C++20	42 / 100	1097 ms	103228 KiB

game

#pragma GCC optimize ("03,unroll-loops")
#include <bits/stdc++.h>
#include "game.h"

using namespace std;

int const MAX=1505;
unordered_set<int>vecF[MAX];
unordered_set<int>candT[MAX];
int muchie;
bool activ[MAX];

void initialize(int n){
    int i,j;
    for(i=0;i<n;++i)
        for(j=0;j<n;++j)
            if(i!=j)
                vecF[i].insert(j);
}

int hasEdge(int u, int v){
    ++muchie;
    vecF[u].erase(v);
    vecF[v].erase(u);
    if(muchie==1){
        activ[u]=activ[v]=1;
        for(auto vec : vecF[u])
            candT[vec].insert(u);
        for(auto vec : vecF[v])
            candT[vec].insert(v);
        return 1;
    }
    if(activ[u] || activ[v]){
        if(activ[v])
            swap(u,v);
        candT[v].erase(u);
        if(candT[v].empty()){
            activ[v]=1;
            for(auto vec : vecF[v])
                candT[vec].insert(v);
            return 1;
        }
    }
    return 0;
}

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