#849237 (PyPy3) No.416 旅行会社

• 問題: No.416 旅行会社
• ユーザー: titia
• 提出日時: 2023-03-15 02:02:54
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,033 ms / 4,000 ms
• コード長: 1,727 bytes
• コンパイル時間: 503 ms
• コンパイル使用メモリ: 81,960 KB
• 実行使用メモリ: 155,496 KB
• 最終ジャッジ日時: 2024-09-18 08:33:26
• 合計ジャッジ時間: 11,104 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
other	AC * 21

ソースコード

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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
N,M,Q=map(int,input().split())
E=[tuple(map(int,input().split())) for i in range(M)]
E2=[tuple(map(int,input().split())) for i in range(Q)]
# UnionFind
Group = [i for i in range(N+1)] # グループ分け
Nodes = [1]*(N+1) # 各グループのノードの数
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)
EDGE=[[] for i in range(N+1)]
for x,y in set(E)-set(E2):
    EDGE[x].append(y)
    EDGE[y].append(x)
    Union(x,y)
ANS=[-1]*(N+1)
Q=[1]
while Q:
    x=Q.pop()
    ANS[x]=0
    for to in EDGE[x]:
        if ANS[to]==-1:
            ANS[to]=0
            Q.append(to)
#print(ANS)
for i in range(len(E2)-1,-1,-1):
    x,y = E2[i]
    Union(x,y)
    EDGE[x].append(y)
    EDGE[y].append(x)
    if ANS[x]==-1 and find(x)==find(1):
        Q=[x]
        while Q:
            x=Q.pop()
            ANS[x]=i+1
            for to in EDGE[x]:
                if ANS[to]==-1:
                    ANS[to]=i+1
                    Q.append(to)
    if ANS[y]==-1 and find(y)==find(1):
        Q=[y]
        while Q:
            x=Q.pop()
            ANS[x]=i+1
            for to in EDGE[x]:
                if ANS[to]==-1:
                    ANS[to]=i+1
                    Q.append(to)
    #print(i,ANS)
for i in range(N+1):
    if ANS[i]==0:
        ANS[i]=-1
    if find(i)!=find(1):
        ANS[i]=0
for a in ANS[2:]:
    print(a)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX