|
|
back to boardwhy wa14??? n,k,_=map(int,input().split()) o=n-1; c=[0]*(n+1) for i in range(n+1):c[i]=i def g(a): while a!=c[a]:a=c[a]=c[c[a]] return a for i in range(k): a,b=map(int,input().split()) x=g(a) y=g(b) c[x]=c[y]=min(x,y) if x!=y: o-=1 print(o) |
|
|