Submission #1207365

#TimeUsernameProblemLanguageResultExecution timeMemory
1207365candi_ositosGame (IOI14_game)C++20
0 / 100
0 ms328 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; vector <int> p; vector <set<int> > jevil; int N; void initialize(int n) { jevil.resize(n); N=n; p.resize(n); for(int i=0; i<n; ++i) { p[i]=i; for(int j=0; j<n; ++j) { jevil[i].insert(j); } jevil[i].erase(i); } } int fgp(int a) { if(p[a]==a) { return a; } return p[a]=fgp(p[a]); } int hasEdge(int u, int v) { if(fgp(u)==fgp(v)) { return 1; } if(jevil[u].count(v)<=1 && (jevil[fgp(u)].size()<=1 || jevil[fgp(v)].size()<=1)) { p[fgp(u)]=fgp(v); return 1; } jevil[u].erase(v); jevil[v].erase(u); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...