結果

問題 No.556 仁義なきサルたち
ユーザー McGregorshMcGregorsh
提出日時 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
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 148 ms
89,444 KB
testcase_01 AC 148 ms
89,128 KB
testcase_02 AC 145 ms
89,164 KB
testcase_03 AC 145 ms
89,088 KB
testcase_04 AC 144 ms
89,088 KB
testcase_05 AC 146 ms
89,472 KB
testcase_06 AC 147 ms
89,472 KB
testcase_07 AC 148 ms
89,444 KB
testcase_08 AC 149 ms
89,044 KB
testcase_09 AC 152 ms
89,636 KB
testcase_10 AC 159 ms
89,696 KB
testcase_11 AC 167 ms
89,984 KB
testcase_12 AC 166 ms
90,064 KB
testcase_13 AC 162 ms
90,288 KB
testcase_14 AC 204 ms
93,440 KB
testcase_15 AC 212 ms
93,780 KB
testcase_16 AC 210 ms
96,512 KB
testcase_17 AC 223 ms
95,104 KB
testcase_18 AC 232 ms
98,024 KB
testcase_19 AC 202 ms
91,092 KB
testcase_20 AC 199 ms
90,924 KB
testcase_21 AC 198 ms
90,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext, ROUND_HALF_UP
def 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 d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 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] = i
   	  count[i] = 1
   
   for i in range(M):
   	  A, B = nums[i]
   	  if P[A] == P[B]:
   	  	  continue
   	  if count[P[A]] > count[P[B]]:
   	  	  count[P[A]] += count[P[B]]
   	  	  count[P[B]] = 0
   	  	  p1 = 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]] = 0
   	  	  	  p1 = 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]] = 0
   	  	  	  p1 = 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]] = 0
   	  	  p1 = 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()
0