Submission #573996

#TimeUsernameProblemLanguageResultExecution timeMemory
573996Valaki2게임 (IOI14_game)C++14
100 / 100
285 ms16312 KiB
#include <bits/stdc++.h>
#include "game.h"
using namespace std;

const int maxn = 1500;

int cnt[maxn + 1];

void initialize(int n) {

}

int hasEdge(int u, int v) {
    return ((cnt[max(u, v)]++) == (max(u, v) - 1));
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...