제출 #1292267

#제출 시각아이디문제언어결과실행 시간메모리
1292267ghammazhassanGame (IOI14_game)C++20
0 / 100
1 ms340 KiB
#include <cstdio> #include <cassert> #include "game.h" const int N=1500+5; int p[N]; int n; int d=0; int get(int x){ if (p[x]==x)return x; return p[x]=get(p[x]); } void uni(int x,int y){ x=get(x); y=get(y); p[y]=x; d++; } void initialize(int ni){ n=ni; for (int i=0;i<n;i++){ p[i]=i; } } int hasEdge(int x,int y){ x=get(x),y=get(y); if (x!=y and d<n-2){ uni(x,y); return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...