제출 #759225

#제출 시각아이디문제언어결과실행 시간메모리
759225Dan4Life게임 (IOI14_game)C++17
100 / 100
351 ms25108 KiB
#include <bits/stdc++.h> using namespace std; int cnt[1501][1501]; int n, z, p[1501], s[1501], v[1501]; int f(int i){return i==p[i]?i:p[i]=f(p[i]);} int unionSet(int x, int y){ fill(v,v+n,0); z=f(0); if(s[x]<s[y]) swap(x,y); p[y]=x; s[x]+=s[y]; v[x]=v[y]=1; for(int i = 0; i < n; z=f(i), i++) if(!v[z]) cnt[z][x]+=cnt[z][y], cnt[x][z]+=cnt[y][z], v[z]=1; return 1; } void initialize(int N){ n = N; fill(s,s+n,1); iota(p,p+n,0); } int hasEdge(int u, int v){ u = f(u), v = f(v); cnt[u][v]++, cnt[v][u]++; if(cnt[u][v]!=s[u]*s[v]) return 0; return unionSet(u,v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...