結果
問題 | No.1769 Don't Stop the Game |
ユーザー | first_vil |
提出日時 | 2021-10-27 22:39:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,463 ms / 3,000 ms |
コード長 | 2,904 bytes |
コンパイル時間 | 433 ms |
コンパイル使用メモリ | 87,116 KB |
実行使用メモリ | 175,216 KB |
最終ジャッジ日時 | 2023-09-12 04:49:43 |
合計ジャッジ時間 | 27,693 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 96 ms
71,352 KB |
testcase_01 | AC | 96 ms
71,540 KB |
testcase_02 | AC | 97 ms
71,656 KB |
testcase_03 | AC | 130 ms
77,964 KB |
testcase_04 | AC | 106 ms
72,004 KB |
testcase_05 | AC | 132 ms
77,648 KB |
testcase_06 | AC | 149 ms
78,256 KB |
testcase_07 | AC | 151 ms
78,576 KB |
testcase_08 | AC | 1,044 ms
112,304 KB |
testcase_09 | AC | 799 ms
104,716 KB |
testcase_10 | AC | 1,095 ms
125,644 KB |
testcase_11 | AC | 759 ms
102,832 KB |
testcase_12 | AC | 1,269 ms
119,516 KB |
testcase_13 | AC | 1,243 ms
120,052 KB |
testcase_14 | AC | 1,278 ms
120,088 KB |
testcase_15 | AC | 1,222 ms
119,896 KB |
testcase_16 | AC | 1,273 ms
119,768 KB |
testcase_17 | AC | 1,358 ms
124,080 KB |
testcase_18 | AC | 1,463 ms
145,216 KB |
testcase_19 | AC | 1,413 ms
157,904 KB |
testcase_20 | AC | 1,448 ms
158,324 KB |
testcase_21 | AC | 1,432 ms
158,600 KB |
testcase_22 | AC | 1,433 ms
157,892 KB |
testcase_23 | AC | 1,222 ms
120,356 KB |
testcase_24 | AC | 1,226 ms
120,512 KB |
testcase_25 | AC | 400 ms
130,164 KB |
testcase_26 | AC | 570 ms
175,216 KB |
testcase_27 | AC | 389 ms
124,620 KB |
testcase_28 | AC | 511 ms
154,604 KB |
testcase_29 | AC | 607 ms
162,044 KB |
testcase_30 | AC | 611 ms
159,700 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 = [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) st2 = deque([]) p30,p31 = 1<<30,1<<31 mask = p30-1 while st1: tmp = st1.pop() cur1,flag,step = tmp&mask,tmp&p30,tmp&p31 if step == 0: st1.append(cur1 | flag | p31) for i in range(len(g[cur1])): st1.append(g[cur1][i][0] | (int(i != 0) * p30)) 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)