Submission #520100

#TimeUsernameProblemLanguageResultExecution timeMemory
520100tjd229Game (IOI14_game)C++14
15 / 100
1 ms288 KiB
#include "game.h" #include <vector> #include <algorithm> using namespace std; int n,cnt; int G[1500],ind[1500]; void initialize(int n) { ::n = n; cnt = 1; } int hasEdge(int u, int v) { if (G[u] + G[v] == 2) return 0; if (G[v] == 1) u ^= v ^= u ^= v; if (++ind[v] == cnt) { ++cnt; G[u] = G[v] = 1; return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...