Submission #1366161

#TimeUsernameProblemLanguageResultExecution timeMemory
1366161retardeGame (IOI14_game)C++20
0 / 100
0 ms344 KiB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

vector<set<int>> cands;
int N = 0;

void initialize(int n) {
    N = n;
    cands.resize(N);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (j == i) continue;
            cands[i].insert(j);
        }
    }
}

bool has(set<int> &x, int y) { return x.find(y) != x.end(); }

int hasEdge(int u, int v) {
    if (min(u,v)>=2) {
        if (cands[u].size()==2 || cands[v].size()==2) {
            return (has(cands[u],v) && has(cands[v], u));
        } else {
            cands[u].erase(v);
            cands[v].erase(u);
            return 0;
        }
    } else {
        return 1;
    }
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...