結果
問題 | No.1 道のショートカット |
ユーザー | terasa |
提出日時 | 2022-11-03 15:48:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 323 ms / 5,000 ms |
コード長 | 2,524 bytes |
コンパイル時間 | 459 ms |
コンパイル使用メモリ | 87,096 KB |
実行使用メモリ | 95,304 KB |
最終ジャッジ日時 | 2023-09-25 00:42:17 |
合計ジャッジ時間 | 12,595 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 169 ms
80,360 KB |
testcase_01 | AC | 168 ms
80,040 KB |
testcase_02 | AC | 168 ms
80,324 KB |
testcase_03 | AC | 170 ms
80,224 KB |
testcase_04 | AC | 165 ms
80,104 KB |
testcase_05 | AC | 164 ms
80,032 KB |
testcase_06 | AC | 164 ms
80,308 KB |
testcase_07 | AC | 165 ms
80,276 KB |
testcase_08 | AC | 252 ms
91,072 KB |
testcase_09 | AC | 204 ms
85,644 KB |
testcase_10 | AC | 226 ms
85,048 KB |
testcase_11 | AC | 251 ms
87,212 KB |
testcase_12 | AC | 323 ms
95,304 KB |
testcase_13 | AC | 312 ms
94,872 KB |
testcase_14 | AC | 181 ms
82,096 KB |
testcase_15 | AC | 167 ms
80,276 KB |
testcase_16 | AC | 181 ms
82,476 KB |
testcase_17 | AC | 169 ms
80,576 KB |
testcase_18 | AC | 181 ms
82,260 KB |
testcase_19 | AC | 181 ms
82,456 KB |
testcase_20 | AC | 229 ms
84,504 KB |
testcase_21 | AC | 191 ms
82,816 KB |
testcase_22 | AC | 179 ms
82,380 KB |
testcase_23 | AC | 281 ms
91,668 KB |
testcase_24 | AC | 295 ms
93,768 KB |
testcase_25 | AC | 240 ms
86,392 KB |
testcase_26 | AC | 219 ms
84,784 KB |
testcase_27 | AC | 287 ms
90,972 KB |
testcase_28 | AC | 179 ms
82,024 KB |
testcase_29 | AC | 211 ms
84,228 KB |
testcase_30 | AC | 177 ms
82,620 KB |
testcase_31 | AC | 193 ms
82,676 KB |
testcase_32 | AC | 245 ms
88,892 KB |
testcase_33 | AC | 231 ms
86,256 KB |
testcase_34 | AC | 270 ms
90,112 KB |
testcase_35 | AC | 176 ms
82,092 KB |
testcase_36 | AC | 195 ms
82,728 KB |
testcase_37 | AC | 178 ms
82,244 KB |
testcase_38 | AC | 181 ms
82,356 KB |
testcase_39 | AC | 185 ms
82,488 KB |
testcase_40 | AC | 180 ms
82,148 KB |
testcase_41 | AC | 172 ms
82,084 KB |
testcase_42 | AC | 168 ms
80,412 KB |
testcase_43 | AC | 166 ms
80,304 KB |
ソースコード
from typing import List, Tuple, Optional import sys import itertools import heapq import bisect from collections import deque, defaultdict from functools import lru_cache, cmp_to_key input = sys.stdin.readline # for AtCoder Easy test if __file__ != 'prog.py': # sys.setrecursionlimit(10 ** 6) pass def readints(): return map(int, input().split()) def readlist(): return list(readints()) def readstr(): return input().rstrip() class Dijkstra: def __init__(self, N: int, E: List[List[Tuple[int, int]]], start: int = 0, inf: int = 1 << 50): self.N = N self.E = E self.start = start self.inf = inf self.C = [self.inf] * N # self.prev = [None] * N self._calculate() def get_cost(self, i: int) -> Optional[int]: """return cost to i-th vertex if reachable otherwise None""" return self.C[i] if self.reachable(i) else self.inf def get_path(self, i) -> Optional[List[int]]: """return shortest path to i-th vertex if reachable otherwise None""" if not self.reachable(i): return None p = [] cur = i while cur is not None: p.append(cur) cur = self.prev[cur] p.reverse() return p def reachable(self, i) -> bool: """return whether i-th vertex from start is reachable""" return self.C[i] < self.inf def _calculate(self) -> None: h = [(0, self.start)] self.C[self.start] = 0 visited = [False] * self.N while h: _, v = heapq.heappop(h) if visited[v] is True: continue visited[v] = True for c, d in self.E[v]: if self.C[d] > self.C[v] + c: self.C[d] = self.C[v] + c # self.prev[d] = v heapq.heappush(h, (self.C[d], d)) N = int(input()) C = int(input()) V = int(input()) S = list(map(lambda x: int(x) - 1, input().split())) T = list(map(lambda x: int(x) - 1, input().split())) Y = readlist() M = readlist() E = [[] for _ in range(N * (C + 1))] for i in range(V): for j in range(C, 0, -1): def h(v, c): return v * (C + 1) + c if j - Y[i] < 0: break E[h(S[i], j)].append((M[i], h(T[i], j - Y[i]))) solver = Dijkstra(N * (C + 1), E, start=C) ans = solver.inf for j in range(C + 1): ans = min(ans, solver.get_cost((N - 1) * (C + 1) + j)) print(ans if ans < solver.inf else -1)