結果
問題 | No.1111 コード進行 |
ユーザー | McGregorsh |
提出日時 | 2023-07-12 21:54:25 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,832 bytes |
コンパイル時間 | 304 ms |
コンパイル使用メモリ | 86,608 KB |
実行使用メモリ | 310,156 KB |
最終ジャッジ日時 | 2023-10-12 11:55:26 |
合計ジャッジ時間 | 18,367 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
89,684 KB |
testcase_01 | AC | 240 ms
89,544 KB |
testcase_02 | AC | 239 ms
89,728 KB |
testcase_03 | WA | - |
testcase_04 | AC | 237 ms
89,696 KB |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | AC | 242 ms
89,832 KB |
testcase_08 | AC | 245 ms
89,940 KB |
testcase_09 | WA | - |
testcase_10 | AC | 250 ms
90,280 KB |
testcase_11 | RE | - |
testcase_12 | WA | - |
testcase_13 | AC | 239 ms
90,112 KB |
testcase_14 | RE | - |
testcase_15 | AC | 240 ms
89,948 KB |
testcase_16 | AC | 239 ms
89,960 KB |
testcase_17 | RE | - |
testcase_18 | AC | 241 ms
89,888 KB |
testcase_19 | AC | 238 ms
89,892 KB |
testcase_20 | RE | - |
testcase_21 | AC | 240 ms
89,624 KB |
testcase_22 | RE | - |
testcase_23 | AC | 247 ms
90,288 KB |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | AC | 240 ms
89,528 KB |
testcase_28 | AC | 324 ms
148,424 KB |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | WA | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | AC | 268 ms
98,508 KB |
testcase_47 | AC | 1,352 ms
310,156 KB |
testcase_48 | AC | 277 ms
98,428 KB |
testcase_49 | AC | 271 ms
98,848 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(N)] 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(N): 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(N): ans += dp[-1][i][-1] ans %= MOD print(ans) if __name__ == '__main__': main()