結果
問題 | No.556 仁義なきサルたち |
ユーザー |
|
提出日時 | 2022-11-01 12:13:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 232 ms / 2,000 ms |
コード長 | 2,818 bytes |
コンパイル時間 | 355 ms |
コンパイル使用メモリ | 82,116 KB |
実行使用メモリ | 98,024 KB |
最終ジャッジ日時 | 2024-07-16 05:51:24 |
合計ジャッジ時間 | 5,402 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
ソースコード
import sys, refrom fractions import Fractionfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reducefrom decimal import Decimal, getcontext, ROUND_HALF_UPdef i_input(): return int(input())def i_map(): return map(int, input().split())def i_list(): return list(i_map())def i_row(N): return [i_input() for _ in range(N)]def i_row_list(N): return [i_list() for _ in range(N)]def s_input(): return input()def s_map(): return input().split()def s_list(): return list(s_map())def s_row(N): return [s_input for _ in range(N)]def s_row_str(N): return [s_list() for _ in range(N)]def s_row_list(N): return [list(s_input()) for _ in range(N)]def lcm(a, b): return a * b // gcd(a, b)def get_distance(x1, y1, x2, y2):d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)return ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353###関数コピーしたか?###def main():N, M = i_map()nums = [i_list() for i in range(M)]P = [0] * (N+1)F = [deque() for i in range(N+1)]count = [0] * (N+1)for i in range(1, N+1):F[i].append(i)P[i] = icount[i] = 1for i in range(M):A, B = nums[i]if P[A] == P[B]:continueif count[P[A]] > count[P[B]]:count[P[A]] += count[P[B]]count[P[B]] = 0p1 = P[B]while F[p1]:point = F[p1].popleft()P[point] = P[A]F[P[A]].append(point)elif count[P[A]] == count[P[B]]:if P[A] > P[B]:count[P[B]] += count[P[A]]count[P[A]] = 0p1 = P[A]while F[p1]:point = F[p1].popleft()F[P[B]].append(point)P[point] = P[B]else:count[P[A]] += count[P[B]]count[P[B]] = 0p1 = P[B]while F[p1]:point = F[p1].popleft()F[P[A]].append(point)P[point] = P[A]elif count[P[A]] < count[P[B]]:count[P[B]] += count[P[A]]count[P[A]] = 0p1 = P[A]while F[p1]:point = F[p1].popleft()P[point] = P[B]F[P[B]].append(point)#print(P, 'p')#print(count, 'c')#print(F, 'F')#print(A, B)for i in range(1, N+1):print(P[i])if __name__ == '__main__':main()