Submission #489151

#TimeUsernameProblemLanguageResultExecution timeMemory
489151SlavicG게임 (IOI14_game)C++17
0 / 100
1 ms256 KiB
#include "bits/stdc++.h" using namespace std; #define ll long long #define forn(i,n) for(int i=0;i<n;i++) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(),v.rend() #define pb push_back #define sz(a) (int)a.size() const int N = 1600; bool asked[N][N]; bool know[N][N]; int par[N], s[N]; int n; int get(int a){ return (a == par[a] ? a : par[a] = get(par[a])); } void uni(int a, int b){ a = get(a), b = get(b); if(s[a] > s[b])swap(a, b); par[a] = b; s[b] += s[a]; } void initialize(int N){ n = N; for(int i = 0;i < n; ++i){ s[i] = 1; par[i] = i; } } int hasEdge(int u, int v){ if(get(u) == get(v)){ return 0; }else{ uni(u, v); return 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...