Submission #381627

#TimeUsernameProblemLanguageResultExecution timeMemory
381627ritul_kr_singhGame (IOI14_game)C++17
0 / 100
1 ms364 KiB
#include "game.h" #include "bits/stdc++.h" using namespace std; vector<int> e; int n; int find(int u){ return e[u] < 0 ? u : e[u] = find(e[u]); } int sz(int u){ return -e[find(u)]; } void unite(int u, int v){ u = find(u), v = find(v); if(u==v) return; if(e[u] > e[v]) swap(u, v); e[u] += e[v], e[v] = u; --n; } void initialize(int N){ n = N; e.assign(n+1, -1); } int hasEdge(int u, int v){ if(find(u)==find(v) or n>2){ unite(u, v); return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...