結果

問題 No.1103 Directed Length Sum
コンテスト
ユーザー dot_haraai
提出日時 2021-03-26 20:45:38
言語 Nim
(2.2.0)
結果
AC  
実行時間 946 ms / 3,000 ms
コード長 1,206 bytes
コンパイル時間 4,981 ms
コンパイル使用メモリ 86,912 KB
実行使用メモリ 68,224 KB
最終ジャッジ日時 2024-11-28 20:36:37
合計ジャッジ時間 16,866 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 8) Warning: imported and not used: 'critbits' [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]

ソースコード

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()
    edges = newseqwith(n,newseq[int]())
    edge_in = newseqwith(n,0)
    depth = newseqwith(n,0)
    root = -1
    md=10^9+7
  for i in 0..<n-1:
    var (s,t) = (scan()-1,scan()-1)
    edges[s].add(t)
    edge_in[t]+=1
  
  for i in 0..<n:
    if edge_in[i]==0:
      root=i
  #echo edges
  proc dfs(r:int)=
    var q = initDeque[int]()
    q.addlast(r)
    depth[r]=0
    while q.len>0:
      var p = q.popFirst()
      for nxt in edges[p]:
        depth[nxt]=depth[p]+1
        q.addLast(nxt)
  dfs(root)
  #echo depth
  for i in 0..<n:
    result+=(depth[i]*(depth[i]+1)).div(2)
    result.mod=md




  

      

  

  
echo solve()
0