結果
問題 | No.1103 Directed Length Sum |
ユーザー | dot_haraai |
提出日時 | 2021-03-26 20:45:38 |
言語 | Nim (2.0.0) |
結果 |
AC
|
実行時間 | 1,107 ms / 3,000 ms |
コード長 | 1,206 bytes |
コンパイル時間 | 7,007 ms |
コンパイル使用メモリ | 73,852 KB |
実行使用メモリ | 102,112 KB |
最終ジャッジ日時 | 2023-08-19 06:31:31 |
合計ジャッジ時間 | 20,006 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 750 ms
99,080 KB |
testcase_03 | AC | 669 ms
102,112 KB |
testcase_04 | AC | 608 ms
58,972 KB |
testcase_05 | AC | 1,107 ms
98,060 KB |
testcase_06 | AC | 365 ms
40,272 KB |
testcase_07 | AC | 72 ms
12,024 KB |
testcase_08 | AC | 118 ms
17,700 KB |
testcase_09 | AC | 42 ms
8,148 KB |
testcase_10 | AC | 164 ms
21,512 KB |
testcase_11 | AC | 668 ms
65,176 KB |
testcase_12 | AC | 364 ms
40,580 KB |
testcase_13 | AC | 168 ms
22,092 KB |
testcase_14 | AC | 30 ms
7,088 KB |
testcase_15 | AC | 279 ms
33,184 KB |
testcase_16 | AC | 771 ms
71,036 KB |
testcase_17 | AC | 813 ms
74,372 KB |
testcase_18 | AC | 160 ms
21,544 KB |
testcase_19 | AC | 689 ms
66,384 KB |
testcase_20 | AC | 51 ms
10,000 KB |
testcase_21 | AC | 102 ms
16,428 KB |
testcase_22 | AC | 550 ms
53,296 KB |
testcase_23 | AC | 299 ms
35,244 KB |
コンパイルメッセージ
/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]
ソースコード
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()