Submission #3445148

---

Source Code Expand

# ランク無し実装

class UnionFind

  def initialize(n)
    @p = *0...n
  end

  def find(x)
    @p[x] == x ? x : @p[x] = find(@p[x])
  end

  def unite(x, y)
    x = find(x)
    y = find(y)
    return if x == y
    @p[x] = y
    nil
  end

  def same(x, y)
    find(x) == find(y)
  end

end

n, q = gets.split.map(&:to_i)

uf = UnionFind.new(n)

q.times do
  p, a, b = gets.split.map(&:to_i)
  case p
  when 0 then uf.unite(a, b)
  when 1 then puts uf.same(a, b) ? "Yes": "No"
  end
end

Submission Info

Judge Result