Submission #142767

#TimeUsernameProblemLanguageResultExecution timeMemory
142767thecodingwizardGame (IOI14_game)C++11
100 / 100
369 ms7952 KiB
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
 
int ct[1500];
void initialize(int N) {
    for (int i = 0; i < N; i++) ct[i] = 0;
}
int hasEdge(int u, int v) {
    return ++ct[max(u, v)] == max(u, v);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...