Submission #30908

#TimeUsernameProblemLanguageResultExecution timeMemory
30908kajebiiiGame (IOI14_game)C++14
100 / 100
473 ms9912 KiB
#include "game.h" #include <algorithm> using namespace std; const int MAX_N = 2e3 + 100; int cnt = 0; int Nr[MAX_N]; void initialize(int n) { cnt = 0; for(int i=0; i<n; i++) Nr[i] = 0; } int hasEdge(int u, int v) { return ++Nr[max(u, v)] == max(u, v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...