Submission #588483

#TimeUsernameProblemLanguageResultExecution timeMemory
588483VanillaGame (IOI14_game)C++17
100 / 100
325 ms16284 KiB
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
const int maxn = 1e3 + 5e2 + 2;
int queries[maxn];

void initialize(int n) {
    for (int i = 0; i < n; i++){
        queries[i] = i;
    }
}

int hasEdge(int u, int v) {
    if (u < v) swap(u,v);
    queries[u]--;
    return !queries[u];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...