結果

問題 No.317 辺の追加
ユーザー vwxyzvwxyz
提出日時 2023-08-03 01:03:14
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 857 ms / 2,000 ms
コード長 3,856 bytes
コンパイル時間 411 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 261,948 KB
最終ジャッジ日時 2024-04-21 00:48:48
合計ジャッジ時間 22,645 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 164 ms
89,472 KB
testcase_01 AC 159 ms
89,420 KB
testcase_02 AC 446 ms
128,296 KB
testcase_03 AC 405 ms
105,288 KB
testcase_04 AC 592 ms
202,252 KB
testcase_05 AC 369 ms
98,652 KB
testcase_06 AC 425 ms
104,192 KB
testcase_07 AC 282 ms
95,104 KB
testcase_08 AC 857 ms
260,544 KB
testcase_09 AC 520 ms
134,832 KB
testcase_10 AC 490 ms
120,756 KB
testcase_11 AC 366 ms
157,132 KB
testcase_12 AC 502 ms
119,868 KB
testcase_13 AC 448 ms
186,432 KB
testcase_14 AC 481 ms
121,476 KB
testcase_15 AC 493 ms
124,972 KB
testcase_16 AC 584 ms
193,592 KB
testcase_17 AC 502 ms
128,504 KB
testcase_18 AC 490 ms
112,052 KB
testcase_19 AC 510 ms
120,244 KB
testcase_20 AC 657 ms
230,976 KB
testcase_21 AC 244 ms
99,884 KB
testcase_22 AC 221 ms
95,500 KB
testcase_23 AC 224 ms
97,028 KB
testcase_24 AC 279 ms
104,740 KB
testcase_25 AC 258 ms
100,440 KB
testcase_26 AC 260 ms
102,296 KB
testcase_27 AC 254 ms
101,536 KB
testcase_28 AC 232 ms
97,328 KB
testcase_29 AC 202 ms
91,532 KB
testcase_30 AC 755 ms
261,948 KB
testcase_31 AC 705 ms
239,164 KB
testcase_32 AC 710 ms
240,324 KB
testcase_33 AC 708 ms
240,836 KB
testcase_34 AC 698 ms
236,988 KB
testcase_35 AC 714 ms
244,540 KB
testcase_36 AC 704 ms
239,984 KB
testcase_37 AC 726 ms
245,432 KB
testcase_38 AC 737 ms
253,884 KB
testcase_39 AC 718 ms
240,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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")
0