#710733 (PyPy3) No.1769 Don't Stop the Game

• 問題: No.1769 Don't Stop the Game
• ユーザー: first_vil
• 提出日時: 2021-10-27 13:36:51
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,035 ms / 3,000 ms
• コード長: 2,852 bytes
• コンパイル時間: 150 ms
• コンパイル使用メモリ: 82,780 KB
• 実行使用メモリ: 171,576 KB
• 最終ジャッジ日時: 2024-06-29 17:49:01
• 合計ジャッジ時間: 19,261 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 28

ソースコード

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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
import sys
input = lambda: sys.stdin.readline().rstrip()
mi = lambda: map(int,input().split())
li = lambda: list(mi())
from collections import deque
n = int(input())
g = [[] for i in range(n)]
for i in range(n-1):
    a,b,c = mi()
    a,b = a-1,b-1
    g[a].append((b,c))
    g[b].append((a,c))
    
siz,x,par = [0]*n,[0]*n,[-1]*n
st1 = deque([0])
while st1:
    cur = st1.pop()
    if siz[cur]:
        g[cur].sort(key = lambda val: -siz[val[0]])
        for to,weight in g[cur]:
            siz[cur] += siz[to]
    else:
        st1.append(cur)
        par_idx = -1
        for i in range(len(g[cur])):
            to,weight = g[cur][i]
            if siz[to]:
                par_idx = i
            else:
                x[to] = x[cur] ^ weight
                par[to] = cur
                st1.append(to)
        if par_idx != -1:
            g[cur][-1],g[cur][par_idx] = g[cur][par_idx],g[cur][-1]
            g[cur].pop()
        siz[cur] = 1
    
sorted_x = sorted(set(x))
for i in range(n):
    ok,ng = 0,len(sorted_x)
    while ng-ok > 1:
        m = (ok+ng) >> 1
        if sorted_x[m] <= x[i]:
            ok = m
        else:
            ng = m
    x[i] = ok
    
y_sum,cnt_sum = [0]*len(sorted_x),[0]*len(sorted_x)
y,cnt = [-1]*n, [-1]*n
ans = n*(n-1)
# st.pop()[1] の0bit目は 0,1 = false/true
# 1bit目は 0,1 = 最初,f(true)の直後
# を表す
st1.append((0,0))
st2 = deque([])
while st1:
    cur1,tmp = st1.pop()
    flag,step = tmp&1,tmp&2
    if step == 0:
        st1.append((cur1, flag | 2))
        for i in range(len(g[cur1])):
            st1.append((g[cur1][i][0], int(i != 0)))
    else:
        for i in range(1,len(g[cur1])):
            st2.append(g[cur1][i][0])
        #dfs1-begin
        while st2:
            cur2 = st2.pop()
            y_sum[x[cur2]] += y[cur2];
            cnt_sum[x[cur2]] += cnt[cur2];
            for to,weight in g[cur2]:
                st2.append(to)
        #dfs1-end
        
        if y[cur1] == -1:
            y[cur1] = siz[cur1] - y_sum[x[cur1]]
            cnt[cur1] = 1 - cnt_sum[x[cur1]]
        ans -= y_sum[x[cur1]]#case-1
        y_sum[x[cur1]] += y[cur1]
        cnt_sum[x[cur1]] += cnt[cur1]
        if cur1 == 0:
            for j in range(len(sorted_x)):
                if j != x[cur1]:
                    ans -= y_sum[j] * cnt_sum[j]#case-3
        else:
            ans -= cnt_sum[x[par[cur1]]] * (n - siz[cur1])#case-2
            ans -= y_sum[x[par[cur1]]] * cnt_sum[x[par[cur1]]]#case-3
            ans += siz[cur1]#case-3
        
        if flag:
            st2.append(cur1)
            #dfs1-begin
            while st2:
                cur2 = st2.pop()
                y_sum[x[cur2]] -= y[cur2];
                cnt_sum[x[cur2]] -= cnt[cur2];
                for to,weight in g[cur2]:
                    st2.append(to)
            #dfs1-end
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX