Submission #49119

#TimeUsernameProblemLanguageResultExecution timeMemory
49119doowey게임 (IOI14_game)C++14
0 / 100
3 ms1008 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int N = 1509; int sz[N]; int uni[N]; int y; void initialize(int n) { y = n; for(int i = 0;i <= n;i ++ ) sz[i] = 1,uni[i] = i; } int fin(int u){ while(uni[u] != u){ u = uni[u]; } return u; } void join(int a,int b){ if(sz[a] > sz[b]) swap(a,b); uni[a] = b; sz[b] += sz[a]; } int hasEdge(int u, int v) { u = fin(u); v = fin(v); if(u == v) return 1; if(sz[u] + sz[v] == y){ return 0; } join(u,v); return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...