#1007199 (PyPy3) No.2377 SUM AND XOR on Tree

• 問題: No.2377 SUM AND XOR on Tree
• ユーザー: LyricalMaestro
• 提出日時: 2024-09-05 20:02:25
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 3,806 ms / 4,000 ms
• コード長: 2,378 bytes
• コンパイル時間: 772 ms
• コンパイル使用メモリ: 82,468 KB
• 実行使用メモリ: 285,544 KB
• 最終ジャッジ日時: 2024-09-05 20:03:28
• 合計ジャッジ時間: 59,685 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 33

ソースコード

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
## https://yukicoder.me/problems/no/2377
from collections import deque
MOD = 998244353
def solve(N, next_nodes, bit_a_list):
    # (現役で繋がろうとしている成分の現時点の1xor, すでに完結している連結成分たちの1xor のAnd)
    # 0: (0, 1), 1: (1, 1)
    dp = [[0, 0] for _ in range(N)]
    parents = [-2] * N
    parents[0] = -1
    stack = deque()
    stack.append((0, 0))
    while len(stack) > 0:
        v, index = stack.pop()
        if index == 0:
            dp[v][bit_a_list[v]] = 1
        else:
            w = next_nodes[v][index - 1]
            new_dp = [0] * 2
            for state in range(2):
                state_num = dp[w][state]
                for base_state in range(2):
                    base_state_num = dp[v][base_state]
                    # つなげる
                    new_state = state ^ base_state
                    new_dp[new_state] += (state_num * base_state_num) % MOD
                    new_dp[new_state] %= MOD
                    # 独立させる
                    if state == 1:
                        new_state = base_state
                        new_dp[new_state] += (state_num * base_state_num) % MOD
                        new_dp[new_state] %= MOD
            dp[v] = new_dp
        
        while index < len(next_nodes[v]):
            w = next_nodes[v][index]
            if w == parents[v]:
                index += 1
                continue
            parents[w] = v
            stack.append((v, index + 1))
            stack.append((w, 0))
            break
    # 最後の仕上げ
    return dp[0][1]
def main():
    N = int(input())
    next_nodes = [[] for _ in range(N)]
    for _ in range(N - 1):
        u, v = map(int, input().split())
        next_nodes[u - 1].append(v - 1)
        next_nodes[v - 1].append(u - 1)
    A = list(map(int, input().split()))
    # Aの各ビットごとに1の数を計算
    max_a = max(A)
    k = 0
    while (1 << k) < max_a:
        k += 1
    max_k = k
    answer = 0
    for k in range(max_k + 1):
        bit_a_list = [0] * N
        for i in range(N):
            a = A[i]
            bit_a_list[i] = 1 if a & (1 << k) > 0 else 0
        
        count = solve(N, next_nodes, bit_a_list)
        answer += (count * (1 << k)) % MOD
        answer %= MOD
    print(answer)
    
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX