Submission #1337000

#TimeUsernameProblemLanguageResultExecution timeMemory
1337000toma_ariciuGame (IOI14_game)C++20
0 / 100
1 ms344 KiB
#include "game.h"

const int maxN = 1505;
int frecv[maxN], N;
bool done[maxN];

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

bool isLast(int u) {
    if (done[u]) {
        return false;
    }
    return frecv[u] == N - 1;
}

int hasEdge(int u, int v) {
    frecv[u]++;
    frecv[v]++;
    if (isLast(u) || isLast(v)) {
        done[u] = 1;
        done[v] = 1;
        return true;
    }

    return false;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...