Submission #120850

#TimeUsernameProblemLanguageResultExecution timeMemory
120850PlurmGame (IOI14_game)C++11
0 / 100
2 ms256 KiB
#include "game.h" #include <cstring> int p[1500]; int f(int u){ if(p[u] == -1) return u; else return p[u] = f(p[u]); } bool u(int x, int y){ x = f(x); y = f(y); if(x == y) return false; p[x] = y; return true; } int e; void initialize(int n) { memset(p, -1, sizeof(p)); e = n-2; } int hasEdge(int u, int v) { if(f(u) == f(v)){ return 1; }else if(e >= 0){ if(::u(u,v)) e--; return 1; }else{ return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...