Submission #10118472

---

Source Code Expand

def main():
  import sys
  
  n,q=map(int,input().split())
  parents=[-1]*(n+1)
  
  for e in sys.stdin.buffer.readlines():
    q,a,b=map(int,e.split())

    if q==0:
      union(parents,a,b)
    if q==1:
      f=same(parents,a,b)
      print("Yes" if f else "No")
    
def root(parents,x):
  if parents[x]<0:
    return x
  else:
    parents[x]=root(parents,parents[x])
    return parents[x]
  
def union(parents,x,y):
  x=root(parents,x)
  y=root(parents,y)
  
  if x==y:
    return
  if x<y:
    x,y=y,x
  parents[x]+=parents[y]
  parents[y]=x
  
  
def same(parents,x,y):
  return root(parents,x)==root(parents,y)
  

  
if __name__=="__main__":
  main()
  

Submission Info

Judge Result