結果

問題 No.1418 Sum of Sum of Subtree Size
ユーザー dot_haraai
提出日時 2021-06-04 00:36:35
言語 Nim
(2.2.0)
結果
AC  
実行時間 186 ms / 2,000 ms
コード長 3,127 bytes
コンパイル時間 5,706 ms
コンパイル使用メモリ 87,040 KB
実行使用メモリ 48,512 KB
最終ジャッジ日時 2024-11-17 14:54:29
合計ジャッジ時間 8,840 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




proc solve():int=
  var
    n = scan()
    es = newseqwith(n,newseq[int]())
    sumTo = newseq[seq[int]](n)
    sizeTo = newseq[seq[int]](n)
    cumScoreL = newseq[seq[int]](n)
    cumScoreR = newseq[seq[int]](n)
    cumSizeL = newseq[seq[int]](n)
    cumSizeR = newseq[seq[int]](n)
    parIdx = newseqwith(n,0)
  for i in 0..<n-1:
    var
      a = scan()-1
      b = scan()-1
    es[a].add(b)
    es[b].add(a)
  var s = -1
  # 始点を探す
  for i in 0..<n:
    if es[i].len==1:
      s = i
      break
  for i in 0..<n:
    sumTo[i] = newseqwith(es[i].len,0)
    sizeTo[i] = newseqwith(es[i].len,0)
    

  

  # return
  # (部分木のサイズ,部分木のスコア)
  proc dfs(par,p:int):(int,int)=
    
    #if es[p].len==1 and es[p][0]==par:return (1,1)
    for idx,nxt in es[p]:
      if par==nxt:
        # 親のインデックスが分かっていると全方位木DPのときに親を除くのが楽
        parIdx[p]=idx
        continue
      (sizeTo[p][idx],sumTo[p][idx]) = dfs(p,nxt)
    cumScoreL[p] = newseq[int](es[p].len+1)
    cumScoreR[p] = newseq[int](es[p].len+1)
    cumSizeL[p] = newseq[int](es[p].len+1)
    cumSizeR[p] = newseq[int](es[p].len+1)
    for idx in 0..<es[p].len:
      cumSizeL[p][idx+1] = cumSizeL[p][idx]+sizeTo[p][idx]
      cumScoreL[p][idx+1] = cumScoreL[p][idx]+sumTo[p][idx]
    for idx in countdown(es[p].len-1,0):
      cumSizeR[p][idx] = cumSizeR[p][idx+1]+sizeTo[p][idx]
      cumScoreR[p][idx] = cumScoreR[p][idx+1]+sumTo[p][idx]
    return (cumSizeR[p][0]+1,cumScoreR[p][0]+cumSizeR[p][0]+1)
  
  discard dfs(-1,s)

  var res = 0
  var resNodes = newseqwith(n,0)
  proc dpfs(par,p,parScore:int)=
    #echo fmt"(par, p, score) = ({par}, {p}, {parScore})"
      # 足すもの
      # ・親方向の自分を含まない子要素のスコア：全方位木DPの根拠
      # ・自分を親とする部分木のサイズ = 常にnでは？？？
      # ・子方向の自分を含まない子要素のスコアの総和
    resNodes[p] = parScore+n+cumScoreR[p][0]+n-(cumSizeR[p][0]+1)
    res+=parScore+n+cumScoreR[p][0]
    res+=n-(cumSizeR[p][0]+1)
    #res+=n-cumSizeR[p][0]
    for idx,nxt in es[p]:
      if par==nxt:continue
      dpfs(p,nxt,cumScoreL[p][idx]+cumScoreR[p][idx+1]+parScore+n-(cumSizeR[p][0]+1))




  
  #echo sumTo.join("\n")
  #echo ""
  #echo sizeTo.join("\n")
  #echo ""
  #echo cumScoreL.join("\n")
  #echo ""
  #echo cumScoreR.join("\n")
  #echo "cumSizeL:"
  #echo cumSizeL.join("\n")
  #echo "cumSizeR:"
  #echo cumSizeR.join("\n")
  dpfs(-1,s,0)
  #echo resNodes
  return res


  
  
  



echo solve()
0