#914166 (PyPy3) No.317 辺の追加

• 問題: No.317 辺の追加
• ユーザー: titia
• 提出日時: 2023-09-20 00:09:41
• 言語: PyPy3 (7.3.15)
• 結果: TLE
• 実行時間: -
• コード長: 1,262 bytes
• コンパイル時間: 158 ms
• コンパイル使用メモリ: 81,664 KB
• 実行使用メモリ: 85,248 KB
• 最終ジャッジ日時: 2024-07-05 21:50:44
• 合計ジャッジ時間: 5,607 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 2
other	TLE * 1 -- * 37

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
N,M=map(int,input().split())
from collections import Counter
# UnionFind
Group = [i for i in range(N)] # グループ分け
Nodes = [1]*(N) # 各グループのノードの数
def find(x):
    while Group[x] != x:
        x=Group[x]
    return x
def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)
for i in range(M):
    x,y=map(int,input().split())
    x-=1
    y-=1
    Union(x,y)
LIST=[]
for i in range(N):
    if find(i)==i:
        LIST.append(Nodes[i])
C=Counter(LIST)
DP=[1<<30]*(N+1)
DP[0]=0
for l in LIST:
    c=C[l]
    LL=[]
    for j in range(30):
        if c>2**i:
            LL.append(2**i)
            c-=2**i
        else:
            LL.append(c)
            break
    #print(DP,LL)
    for x in LL:
        for j in range(N-x*l,-1,-1):
            if DP[j]!=1<<30:
                DP[j+x*l]=min(DP[j+x*l],DP[j]+x)
    #print(DP)
for i in range(1,N+1):
    if DP[i]==1<<30:
        print(-1)
    else:
        print(DP[i]-1)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX