結果
問題 | No.1749 ラムドスウイルスの感染拡大 |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 20:53:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 386 ms / 2,000 ms |
コード長 | 1,800 bytes |
コンパイル時間 | 317 ms |
コンパイル使用メモリ | 86,972 KB |
実行使用メモリ | 94,800 KB |
最終ジャッジ日時 | 2023-09-23 11:31:16 |
合計ジャッジ時間 | 11,692 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
92,408 KB |
testcase_01 | AC | 251 ms
92,276 KB |
testcase_02 | AC | 246 ms
92,244 KB |
testcase_03 | AC | 243 ms
92,364 KB |
testcase_04 | AC | 302 ms
94,236 KB |
testcase_05 | AC | 252 ms
92,288 KB |
testcase_06 | AC | 280 ms
94,564 KB |
testcase_07 | AC | 277 ms
94,800 KB |
testcase_08 | AC | 248 ms
92,284 KB |
testcase_09 | AC | 251 ms
93,168 KB |
testcase_10 | AC | 335 ms
94,100 KB |
testcase_11 | AC | 333 ms
93,760 KB |
testcase_12 | AC | 386 ms
94,412 KB |
testcase_13 | AC | 268 ms
94,344 KB |
testcase_14 | AC | 265 ms
93,424 KB |
testcase_15 | AC | 270 ms
93,688 KB |
testcase_16 | AC | 281 ms
94,144 KB |
testcase_17 | AC | 309 ms
94,292 KB |
testcase_18 | AC | 382 ms
94,312 KB |
testcase_19 | AC | 353 ms
94,084 KB |
testcase_20 | AC | 268 ms
94,716 KB |
testcase_21 | AC | 266 ms
94,612 KB |
testcase_22 | AC | 252 ms
92,184 KB |
testcase_23 | AC | 259 ms
93,228 KB |
testcase_24 | AC | 251 ms
93,356 KB |
testcase_25 | AC | 313 ms
94,084 KB |
testcase_26 | AC | 287 ms
94,236 KB |
testcase_27 | AC | 280 ms
93,560 KB |
testcase_28 | AC | 309 ms
94,408 KB |
testcase_29 | AC | 295 ms
94,240 KB |
ソースコード
import sys, re from fractions import Fraction 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 from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 ###関数コピーしたか?### def main(): n, m, T = i_map() now = [0] * n now[0] = 1 nums = [[] for i in range(n)] for i in range(m): s, t = i_map() nums[s].append(t) nums[t].append(s) for i in range(T): lines = deepcopy(now) for j in range(n): lines[j] = 0 for k in nums[j]: lines[j] += now[k] lines[j] %= MOD2 now = lines #print(now) print(now[0] % MOD2) if __name__ == '__main__': main()