Submission #1064473

#TimeUsernameProblemLanguageResultExecution timeMemory
1064473sunboiGame (IOI14_game)C++14
0 / 100
1 ms444 KiB


#include <bits/stdc++.h>
using namespace std;



set<int> val;
int s = 0;

void initialize(int n){
    s = n;
}

int hasEdge(int u, int v){
    if ((long long)(val.size()) == s - 1){
        if (val.count(u) && val.count(v)) return 1;
        else return 0;
    }else if ((long long)(val.size()) == s - 2){
        if (!val.count(u) && !val.count(v)) return 0;
        else {
            val.insert(u);
            val.insert(v);
            return 1;
        }
    }else {
        val.insert(u);
        val.insert(v);
        return 1;
    }
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...