結果
問題 | No.827 総神童数 |
ユーザー | dot_haraai |
提出日時 | 2021-06-13 19:21:26 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 295 ms / 2,000 ms |
コード長 | 1,700 bytes |
コンパイル時間 | 5,599 ms |
コンパイル使用メモリ | 75,408 KB |
実行使用メモリ | 30,196 KB |
最終ジャッジ日時 | 2023-08-24 22:25:00 |
合計ジャッジ時間 | 13,534 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 251 ms
29,676 KB |
testcase_10 | AC | 85 ms
12,424 KB |
testcase_11 | AC | 5 ms
4,376 KB |
testcase_12 | AC | 35 ms
7,020 KB |
testcase_13 | AC | 205 ms
24,364 KB |
testcase_14 | AC | 9 ms
4,376 KB |
testcase_15 | AC | 77 ms
11,648 KB |
testcase_16 | AC | 209 ms
24,736 KB |
testcase_17 | AC | 247 ms
28,448 KB |
testcase_18 | AC | 96 ms
14,072 KB |
testcase_19 | AC | 295 ms
30,196 KB |
testcase_20 | AC | 219 ms
22,288 KB |
testcase_21 | AC | 154 ms
17,232 KB |
testcase_22 | AC | 233 ms
24,368 KB |
testcase_23 | AC | 3 ms
4,380 KB |
testcase_24 | AC | 258 ms
26,920 KB |
testcase_25 | AC | 196 ms
20,820 KB |
testcase_26 | AC | 263 ms
27,088 KB |
testcase_27 | AC | 177 ms
18,784 KB |
testcase_28 | AC | 166 ms
18,608 KB |
testcase_29 | AC | 123 ms
15,456 KB |
testcase_30 | AC | 35 ms
6,760 KB |
testcase_31 | AC | 93 ms
12,788 KB |
testcase_32 | AC | 92 ms
12,432 KB |
testcase_33 | AC | 284 ms
28,556 KB |
testcase_34 | AC | 257 ms
26,676 KB |
testcase_35 | AC | 96 ms
12,924 KB |
testcase_36 | AC | 140 ms
16,832 KB |
testcase_37 | AC | 193 ms
20,828 KB |
testcase_38 | AC | 279 ms
29,200 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, 18) Warning: imported and not used: 'future' [UnusedImport] /home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [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]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets import critbits, future, strformat, deques,heapqueue 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 scanbf(): BiggestFloat = read().parseFloat proc toInt(c:char): int = return int(c) - int('0') proc xgcd(a,b:int):(int,int,int)= var b = b x0=1 y0=0 x1=0 y1=1 q:int a = a while b!=0: (q,a,b) = (a.div(b),b,a.mod(b)) (x0,x1)=(x1,x0-q*x1) (y0,y1)=(y1,y0-q*y1) return (a,x0,y0) # modの逆元 proc modinv(a,m:int):int= var (g,x,y)=xgcd(a,m) if g!=1: return -1 else: return ((x mod m)+m).mod(m) proc solve():int= var n = scan() es = newseqwith(n,newseq[int]()) fact = newseqwith(n+1,1) depth = newseqwith(n,int.high.div(4)) minv = newseqwith(n+1,0) md = 10^9+7 for i in 0..<n-1: var (u,v) = (scan()-1,scan()-1) es[u].add(v) es[v].add(u) fact[1]=1 for i in 2..n: fact[i]=(fact[i-1]*i).mod(md) for i in 1..n: minv[i] = modinv(i,md) var q = initDeque[int]() q.addLast(0) depth[0]=1 while q.len>0: var p = q.popFirst for nxt in es[p]: if depth[nxt]>depth[p]+1: depth[nxt]=depth[p]+1 q.addLast(nxt) #echo depth for i in 0..<n: result+=fact[n]*minv[depth[i]] result.mod=md result = (result.mod(md)+md).mod(md) echo solve()