結果
問題 | No.1769 Don't Stop the Game |
ユーザー | first_vil |
提出日時 | 2021-10-27 23:11:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,184 ms / 3,000 ms |
コード長 | 2,681 bytes |
コンパイル時間 | 529 ms |
コンパイル使用メモリ | 86,792 KB |
実行使用メモリ | 179,824 KB |
最終ジャッジ日時 | 2023-09-12 04:49:05 |
合計ジャッジ時間 | 23,076 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
71,724 KB |
testcase_01 | AC | 97 ms
71,544 KB |
testcase_02 | AC | 97 ms
71,728 KB |
testcase_03 | AC | 129 ms
77,932 KB |
testcase_04 | AC | 106 ms
72,228 KB |
testcase_05 | AC | 128 ms
77,508 KB |
testcase_06 | AC | 137 ms
78,180 KB |
testcase_07 | AC | 144 ms
78,352 KB |
testcase_08 | AC | 835 ms
117,284 KB |
testcase_09 | AC | 675 ms
107,996 KB |
testcase_10 | AC | 886 ms
129,720 KB |
testcase_11 | AC | 649 ms
106,856 KB |
testcase_12 | AC | 964 ms
124,860 KB |
testcase_13 | AC | 954 ms
125,912 KB |
testcase_14 | AC | 943 ms
125,760 KB |
testcase_15 | AC | 954 ms
124,864 KB |
testcase_16 | AC | 953 ms
125,156 KB |
testcase_17 | AC | 978 ms
128,700 KB |
testcase_18 | AC | 1,122 ms
149,856 KB |
testcase_19 | AC | 1,106 ms
162,228 KB |
testcase_20 | AC | 1,100 ms
163,236 KB |
testcase_21 | AC | 1,184 ms
162,700 KB |
testcase_22 | AC | 1,132 ms
162,900 KB |
testcase_23 | AC | 953 ms
124,964 KB |
testcase_24 | AC | 945 ms
125,668 KB |
testcase_25 | AC | 407 ms
134,524 KB |
testcase_26 | AC | 565 ms
179,824 KB |
testcase_27 | AC | 385 ms
128,752 KB |
testcase_28 | AC | 512 ms
159,312 KB |
testcase_29 | AC | 606 ms
166,916 KB |
testcase_30 | AC | 619 ms
164,492 KB |
ソースコード
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,In,Out,when = [0]*n,[0]*n,[-1]*n,[0]*n,[0]*n,[0]*n st = deque([0]) now = 0 while st: cur = st.pop() if siz[cur]: Out[cur] = now g[cur].sort(key = lambda val: -siz[val[0]]) for to,weight in g[cur]: siz[cur] += siz[to] else: In[cur] = now when[now] = cur now += 1 st.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 st.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.append(0) p30,p31 = 1<<30,1<<31 mask = p30-1 while st: tmp = st.pop() cur1,flag,step = tmp&mask,tmp&p30,tmp&p31 if step == 0: st.append(cur1 | flag | p31) for i in range(len(g[cur1])): st.append(g[cur1][i][0] | (int(i != 0) * p30)) else: for i in range(1,len(g[cur1])): for t in range(In[g[cur1][i][0]],Out[g[cur1][i][0]]): cur2 = when[t] y_sum[x[cur2]] += y[cur2] cnt_sum[x[cur2]] += cnt[cur2] 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: for t in range(In[cur1],Out[cur1]): cur2 = when[t] y_sum[x[cur2]] -= y[cur2] cnt_sum[x[cur2]] -= cnt[cur2] print(ans)