結果
問題 | No.1111 コード進行 |
ユーザー | McGregorsh |
提出日時 | 2023-07-12 21:57:10 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,838 bytes |
コンパイル時間 | 284 ms |
コンパイル使用メモリ | 86,632 KB |
実行使用メモリ | 310,460 KB |
最終ジャッジ日時 | 2023-10-12 11:57:47 |
合計ジャッジ時間 | 20,137 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
90,632 KB |
testcase_01 | AC | 250 ms
90,740 KB |
testcase_02 | AC | 242 ms
89,896 KB |
testcase_03 | WA | - |
testcase_04 | AC | 245 ms
89,796 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 259 ms
90,780 KB |
testcase_08 | AC | 258 ms
90,872 KB |
testcase_09 | WA | - |
testcase_10 | AC | 265 ms
97,976 KB |
testcase_11 | AC | 256 ms
91,072 KB |
testcase_12 | WA | - |
testcase_13 | AC | 259 ms
90,908 KB |
testcase_14 | WA | - |
testcase_15 | AC | 260 ms
91,116 KB |
testcase_16 | AC | 272 ms
96,112 KB |
testcase_17 | AC | 266 ms
98,036 KB |
testcase_18 | AC | 263 ms
90,800 KB |
testcase_19 | AC | 253 ms
90,684 KB |
testcase_20 | AC | 256 ms
90,884 KB |
testcase_21 | AC | 249 ms
90,804 KB |
testcase_22 | AC | 275 ms
100,480 KB |
testcase_23 | AC | 260 ms
90,896 KB |
testcase_24 | AC | 261 ms
91,084 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 256 ms
90,788 KB |
testcase_28 | AC | 415 ms
201,360 KB |
testcase_29 | AC | 344 ms
138,532 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 369 ms
171,052 KB |
testcase_35 | AC | 404 ms
193,480 KB |
testcase_36 | AC | 782 ms
199,988 KB |
testcase_37 | AC | 399 ms
120,200 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | AC | 459 ms
213,856 KB |
testcase_42 | AC | 492 ms
142,804 KB |
testcase_43 | WA | - |
testcase_44 | AC | 326 ms
115,796 KB |
testcase_45 | AC | 446 ms
166,252 KB |
testcase_46 | AC | 273 ms
98,556 KB |
testcase_47 | AC | 1,342 ms
310,460 KB |
testcase_48 | AC | 272 ms
98,152 KB |
testcase_49 | AC | 278 ms
98,416 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, M, K = i_map() G = [[] for i in range(300)] for i in range(M): p, q, c = i_map() p -= 1 q -= 1 G[p].append([q, c]) dp = [[[0] * (K+1) for i in range(300)] for i in range(N)] for i in range(N): dp[0][i][0] = 1 for i in range(N-1): for j in range(300): for k in range(K+1): for nxt, cost in G[j]: if k + cost <= K: dp[i+1][nxt][k+cost] += dp[i][j][k] dp[i+1][nxt][k+cost] %= MOD ans = 0 for i in range(300): ans += dp[-1][i][-1] ans %= MOD print(ans) if __name__ == '__main__': main()