結果

問題 No.1111 コード進行
ユーザー dot_haraaidot_haraai
提出日時 2021-06-11 21:37:45
言語 Nim
(2.0.2)
結果
AC  
実行時間 707 ms / 2,000 ms
コード長 1,358 bytes
コンパイル時間 3,582 ms
コンパイル使用メモリ 73,792 KB
実行使用メモリ 214,932 KB
最終ジャッジ日時 2023-08-21 11:48:18
合計ジャッジ時間 8,807 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 3 ms
4,380 KB
testcase_06 AC 7 ms
5,044 KB
testcase_07 AC 7 ms
5,052 KB
testcase_08 AC 5 ms
4,928 KB
testcase_09 AC 5 ms
4,380 KB
testcase_10 AC 6 ms
4,716 KB
testcase_11 AC 4 ms
4,608 KB
testcase_12 AC 9 ms
4,824 KB
testcase_13 AC 4 ms
4,656 KB
testcase_14 AC 14 ms
5,048 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 11 ms
5,620 KB
testcase_17 AC 5 ms
4,376 KB
testcase_18 AC 3 ms
4,380 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 3 ms
4,376 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 8 ms
5,452 KB
testcase_23 AC 5 ms
4,976 KB
testcase_24 AC 5 ms
4,376 KB
testcase_25 AC 17 ms
7,056 KB
testcase_26 AC 12 ms
5,176 KB
testcase_27 AC 4 ms
4,380 KB
testcase_28 AC 46 ms
7,008 KB
testcase_29 AC 40 ms
17,048 KB
testcase_30 AC 78 ms
12,996 KB
testcase_31 AC 8 ms
4,456 KB
testcase_32 AC 122 ms
18,264 KB
testcase_33 AC 132 ms
12,184 KB
testcase_34 AC 34 ms
6,488 KB
testcase_35 AC 48 ms
9,420 KB
testcase_36 AC 360 ms
105,760 KB
testcase_37 AC 154 ms
87,908 KB
testcase_38 AC 98 ms
44,676 KB
testcase_39 AC 215 ms
26,224 KB
testcase_40 AC 284 ms
84,772 KB
testcase_41 AC 88 ms
25,948 KB
testcase_42 AC 210 ms
94,084 KB
testcase_43 AC 172 ms
53,184 KB
testcase_44 AC 56 ms
31,028 KB
testcase_45 AC 117 ms
49,128 KB
testcase_46 AC 20 ms
18,532 KB
testcase_47 AC 707 ms
19,208 KB
testcase_48 AC 213 ms
214,932 KB
testcase_49 AC 158 ms
160,748 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')


var
  dp:array[300,array[300,array[301,int]]]
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