結果
問題 | No.317 辺の追加 |
ユーザー | vwxyz |
提出日時 | 2023-08-03 01:03:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 797 ms / 2,000 ms |
コード長 | 3,856 bytes |
コンパイル時間 | 206 ms |
コンパイル使用メモリ | 82,076 KB |
実行使用メモリ | 261,464 KB |
最終ジャッジ日時 | 2024-10-12 23:08:13 |
合計ジャッジ時間 | 20,952 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 151 ms
89,344 KB |
testcase_01 | AC | 147 ms
88,832 KB |
testcase_02 | AC | 389 ms
128,048 KB |
testcase_03 | AC | 349 ms
104,904 KB |
testcase_04 | AC | 523 ms
201,996 KB |
testcase_05 | AC | 319 ms
98,276 KB |
testcase_06 | AC | 366 ms
103,808 KB |
testcase_07 | AC | 252 ms
94,592 KB |
testcase_08 | AC | 797 ms
260,036 KB |
testcase_09 | AC | 459 ms
134,324 KB |
testcase_10 | AC | 424 ms
119,988 KB |
testcase_11 | AC | 324 ms
156,764 KB |
testcase_12 | AC | 423 ms
119,236 KB |
testcase_13 | AC | 393 ms
185,924 KB |
testcase_14 | AC | 414 ms
121,032 KB |
testcase_15 | AC | 427 ms
124,604 KB |
testcase_16 | AC | 518 ms
193,320 KB |
testcase_17 | AC | 441 ms
128,256 KB |
testcase_18 | AC | 436 ms
111,672 KB |
testcase_19 | AC | 430 ms
119,864 KB |
testcase_20 | AC | 569 ms
230,460 KB |
testcase_21 | AC | 219 ms
99,372 KB |
testcase_22 | AC | 205 ms
95,360 KB |
testcase_23 | AC | 205 ms
96,512 KB |
testcase_24 | AC | 245 ms
104,448 KB |
testcase_25 | AC | 226 ms
100,224 KB |
testcase_26 | AC | 234 ms
101,904 KB |
testcase_27 | AC | 225 ms
101,024 KB |
testcase_28 | AC | 209 ms
97,280 KB |
testcase_29 | AC | 183 ms
90,880 KB |
testcase_30 | AC | 689 ms
261,464 KB |
testcase_31 | AC | 651 ms
239,296 KB |
testcase_32 | AC | 640 ms
239,424 KB |
testcase_33 | AC | 648 ms
240,828 KB |
testcase_34 | AC | 634 ms
236,224 KB |
testcase_35 | AC | 640 ms
243,640 KB |
testcase_36 | AC | 648 ms
239,680 KB |
testcase_37 | AC | 657 ms
243,644 KB |
testcase_38 | AC | 649 ms
253,244 KB |
testcase_39 | AC | 627 ms
240,444 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write class UnionFind: def __init__(self,N,label=None,f=None,weighted=False): self.N=N self.parents=[None]*self.N self.size=[1]*self.N self.roots={i for i in range(self.N)} self.label=label if self.label!=None: self.label=[x for x in label] self.f=f self.weighted=weighted if self.weighted: self.weight=[0]*self.N def Find(self,x): stack=[] while self.parents[x]!=None: stack.append(x) x=self.parents[x] if self.weighted: w=0 for y in stack[::-1]: self.parents[y]=x w+=self.weight[y] self.weight[y]=w else: for y in stack[::-1]: self.parents[y]=x return x def Union(self,x,y,w=None): root_x=self.Find(x) root_y=self.Find(y) if root_x==root_y: if self.weighted: if self.weight[y]-self.weight[x]==w: return True else: return False else: if self.size[root_x]<self.size[root_y]: x,y=y,x root_x,root_y=root_y,root_x if self.weighted: w=-w self.parents[root_y]=root_x self.size[root_x]+=self.size[root_y] self.roots.remove(root_y) if self.label!=None: self.label[root_x]=self.f(self.label[root_x],self.label[root_y]) if self.weighted: self.weight[root_y]=w+self.weight[x]-self.weight[y] def Size(self,x): return self.size[self.Find(x)] def Same(self,x,y): return self.Find(x)==self.Find(y) def Label(self,x): return self.label[self.Find(x)] def Weight(self,x,y): root_x=self.Find(x) root_y=self.Find(y) if root_x!=root_y: return None return self.weight[y]-self.weight[x] def Roots(self): return list(self.roots) def Linked_Components_Count(self): return len(self.roots) def Linked_Components(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return linked_components def __str__(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return "\n".join(f"{r}: {m}" for r,m in linked_components.items()) N,M=map(int,readline().split()) UF=UnionFind(N) for m in range(M): u,v=map(int,readline().split()) u-=1;v-=1 UF.Union(u,v) S=[] for r in UF.roots: S.append(UF.Size(r)) inf=1<<30 dp=[inf]*(N+1) dp[0]=0 for s,cnt in Counter(S).items(): C=[] c=1 while cnt: C.append(min(cnt,c)) cnt-=min(cnt,c) c*=2 for c in C: prev=dp dp=[mi for mi in prev] for n in range(N+1): if 0<=n+s*c<=N: dp[n+s*c]=min(dp[n+s*c],prev[n]+c) ans_lst=[dp[n]-1 if dp[n]!=inf else -1 for n in range(1,N+1)] print(*ans_lst,sep="\n")