結果

問題 No.1111 コード進行
ユーザー dot_haraaidot_haraai
提出日時 2021-06-11 21:35:36
言語 Nim
(2.0.2)
結果
AC  
実行時間 1,059 ms / 2,000 ms
コード長 1,310 bytes
コンパイル時間 4,337 ms
コンパイル使用メモリ 75,104 KB
実行使用メモリ 369,308 KB
最終ジャッジ日時 2023-08-21 11:45:05
合計ジャッジ時間 10,805 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 5 ms
6,784 KB
testcase_06 AC 10 ms
8,208 KB
testcase_07 AC 9 ms
7,216 KB
testcase_08 AC 4 ms
4,636 KB
testcase_09 AC 8 ms
8,068 KB
testcase_10 AC 11 ms
10,612 KB
testcase_11 AC 4 ms
4,636 KB
testcase_12 AC 12 ms
8,196 KB
testcase_13 AC 6 ms
7,404 KB
testcase_14 AC 19 ms
10,580 KB
testcase_15 AC 3 ms
4,376 KB
testcase_16 AC 14 ms
8,812 KB
testcase_17 AC 10 ms
10,568 KB
testcase_18 AC 4 ms
4,704 KB
testcase_19 AC 3 ms
4,468 KB
testcase_20 AC 5 ms
5,692 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 14 ms
13,732 KB
testcase_23 AC 6 ms
6,592 KB
testcase_24 AC 8 ms
8,708 KB
testcase_25 AC 23 ms
14,304 KB
testcase_26 AC 15 ms
7,912 KB
testcase_27 AC 4 ms
4,472 KB
testcase_28 AC 141 ms
222,304 KB
testcase_29 AC 60 ms
56,788 KB
testcase_30 AC 145 ms
147,480 KB
testcase_31 AC 18 ms
17,952 KB
testcase_32 AC 161 ms
72,504 KB
testcase_33 AC 169 ms
48,708 KB
testcase_34 AC 80 ms
95,584 KB
testcase_35 AC 98 ms
111,292 KB
testcase_36 AC 366 ms
114,696 KB
testcase_37 AC 107 ms
32,912 KB
testcase_38 AC 93 ms
24,516 KB
testcase_39 AC 285 ms
138,288 KB
testcase_40 AC 297 ms
120,096 KB
testcase_41 AC 131 ms
132,852 KB
testcase_42 AC 177 ms
59,312 KB
testcase_43 AC 176 ms
51,888 KB
testcase_44 AC 53 ms
28,504 KB
testcase_45 AC 141 ms
112,036 KB
testcase_46 AC 12 ms
8,828 KB
testcase_47 AC 1,059 ms
369,308 KB
testcase_48 AC 12 ms
8,856 KB
testcase_49 AC 11 ms
8,856 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, 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()=
  var
    nmax=300
    md = 10^9+7
    n = scan()
    m = scan()
    k = scan()
    es = newseqwith(nmax,newseq[int]())
    cs = newseqwith(nmax,newseq[int]())
    dp = newseqwith(n,newseqwith(nmax,newseqwith(k+1,0)))
  for i in 0..<m:
    var
      a = scan()-1
      b = scan()-1
      c = scan()
    es[a].add(b)
    cs[a].add(c)
  for j in 0..<nmax:
    dp[0][j][0]=1
  for i in 0..<n-1:
    for j in 0..<nmax:
      for l in 0..k:
        for nIdx in 0..<es[j].len:
          var
            nxt = es[j][nIdx]
            complex = cs[j][nIdx]
          if complex+l<=k:
            dp[i+1][nxt][complex+l]+=dp[i][j][l]
            dp[i+1][nxt][complex+l].mod=md
  var
    res = 0
  for j in 0..<nmax:
    res+=dp[n-1][j][k]
    res.mod=md
  echo res




solve()
0