The Earliest Moment When Everyone Become

lcpy gen -n 1101   # by problem number
lcpy gen -s the_earliest_moment_when_everyone_become_friends   # by problem name

Input: logs = [[20190101,0,1],[20190104,3,4],[20190107,2,3],[20190211,1,5],[20190224,2,4],[20190301,0,3],[20190312,1,2],[20190322,4,5]], n = 6
Output: 20190301
Explanation: After the event at timestamp 20190301, every person becomes acquainted with every other person.

Input: logs = [[0,2,0],[1,0,1],[3,0,3],[4,1,2],[7,3,1]], n = 4
Output: 3

class Solution:
    # Time: O(m log m) for sorting the logs
    # Space: O(n)
    def earliest_acq(self, logs: list[list[int]], n: int) -> int:
        parent = list(range(n))

        def find(x: int) -> int:
            while parent[x] != x:
                parent[x] = parent[parent[x]]
                x = parent[x]
            return x

        components = n
        for timestamp, x, y in sorted(logs):
            rx, ry = find(x), find(y)
            if rx == ry:
                continue
            parent[rx] = ry
            components -= 1
            if components == 1:
                return timestamp
        return -1