Submission #713446

#TimeUsernameProblemLanguageResultExecution timeMemory
713446Spade1Game (IOI14_game)C++14
15 / 100
1 ms212 KiB
#include <bits/stdc++.h>
#include "game.h"
//#include "grader.cpp"
using namespace std;

const int maxN = 2000;
int cnt[maxN], cur, n;

void initialize(int n) {
    ::n = n;
    for (int i = 0; i < n; ++i) cnt[i] = n-1;
    cur = n*(n-1)/2;
}

int hasEdge(int u, int v) {
    if (cur < n) return 1;
    if (cnt[u] != 1) swap(u, v);
    if (cnt[u] == 1) {
        cnt[u]--;
        cnt[v]--;
        return 1;
    }
    cnt[u]--;
    cnt[v]--;
    cur--;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...