Submission #65686

#TimeUsernameProblemLanguageResultExecution timeMemory
65686KubalionzzaleGame (IOI14_game)C++14
0 / 100
2 ms632 KiB
#include "game.h"

#include <iostream>

int cnt[160000] = { 0 }, cnting = 0, cnting2 = 0;
int n;
int maxi = (n * (n - 1)) / 2, ending = 0;
void initialize(int N) {
    n = N;
    maxi = (n * (n - 1)) / 2;
}

int hasEdge(int u, int v) {
    ++cnting;
    ++cnt[u];
    ++cnt[v];
    if (cnt[u] == n - 1 || cnt[v] == n - 1)
    {
        cnt[u] = 1e6;
        cnt[v] = 1e6;
        ending = 0;
        return 1;
    }
    if ((cnt[u] == n - 2 || cnt[v] == n - 2) && (ending > 0))
    {
        cnt[u] = 1e6;
        cnt[v] = 1e6;
        return 1;
    }
    if ((cnt[u] == n - 2 && cnt[v] == n - 2))
    {
        cnt[u] = 1e6;
        cnt[v] = 1e6;
        return 1;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...