Submission #989566

#TimeUsernameProblemLanguageResultExecution timeMemory
989566the_coding_poohGame (IOI14_game)C++14
100 / 100
229 ms16300 KiB
#include <bits/stdc++.h>
#define uwu return 0;

using namespace std;

const int SIZE = 1.5e3 + 5;

int cnt[SIZE], N;

void initialize(int n){
    N = n;
    for (int i = 1; i < N; i++){
        cnt[i] = i;
    }
    return;
}

int hasEdge(int a, int b){
    if(a > b)
        swap(a, b);
    return (--cnt[b]) == 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...