結果

問題 No.556 仁義なきサルたち
ユーザー McGregorshMcGregorsh
提出日時 2022-11-01 12:13:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 339 ms / 2,000 ms
コード長 2,818 bytes
コンパイル時間 329 ms
コンパイル使用メモリ 87,068 KB
実行使用メモリ 102,916 KB
最終ジャッジ日時 2023-09-23 05:54:03
合計ジャッジ時間 8,208 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 250 ms
93,016 KB
testcase_01 AC 249 ms
92,992 KB
testcase_02 AC 247 ms
92,992 KB
testcase_03 AC 249 ms
92,828 KB
testcase_04 AC 250 ms
92,924 KB
testcase_05 AC 249 ms
92,820 KB
testcase_06 AC 251 ms
92,900 KB
testcase_07 AC 253 ms
92,788 KB
testcase_08 AC 258 ms
92,840 KB
testcase_09 AC 259 ms
93,476 KB
testcase_10 AC 261 ms
93,488 KB
testcase_11 AC 272 ms
94,252 KB
testcase_12 AC 271 ms
94,424 KB
testcase_13 AC 262 ms
94,032 KB
testcase_14 AC 299 ms
95,700 KB
testcase_15 AC 311 ms
95,624 KB
testcase_16 AC 302 ms
96,008 KB
testcase_17 AC 325 ms
102,240 KB
testcase_18 AC 339 ms
102,588 KB
testcase_19 AC 314 ms
102,800 KB
testcase_20 AC 308 ms
102,916 KB
testcase_21 AC 309 ms
102,752 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