結果
問題 | No.1449 新プロランド |
ユーザー | terasa |
提出日時 | 2022-11-03 16:19:06 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,647 bytes |
コンパイル時間 | 373 ms |
コンパイル使用メモリ | 87,200 KB |
実行使用メモリ | 245,652 KB |
最終ジャッジ日時 | 2023-08-25 16:54:22 |
合計ジャッジ時間 | 13,985 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 176 ms
83,164 KB |
testcase_01 | AC | 252 ms
89,364 KB |
testcase_02 | AC | 323 ms
98,400 KB |
testcase_03 | AC | 234 ms
88,972 KB |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | AC | 847 ms
182,740 KB |
testcase_07 | AC | 555 ms
160,516 KB |
testcase_08 | RE | - |
testcase_09 | AC | 571 ms
146,412 KB |
testcase_10 | RE | - |
testcase_11 | AC | 472 ms
179,760 KB |
testcase_12 | AC | 1,034 ms
210,396 KB |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | AC | 960 ms
196,980 KB |
testcase_16 | AC | 729 ms
159,240 KB |
testcase_17 | RE | - |
testcase_18 | AC | 181 ms
83,724 KB |
testcase_19 | AC | 247 ms
125,400 KB |
testcase_20 | AC | 171 ms
83,164 KB |
testcase_21 | AC | 576 ms
168,056 KB |
testcase_22 | AC | 276 ms
93,400 KB |
testcase_23 | AC | 383 ms
194,740 KB |
testcase_24 | AC | 467 ms
121,480 KB |
testcase_25 | AC | 322 ms
103,928 KB |
testcase_26 | RE | - |
testcase_27 | AC | 1,254 ms
245,652 KB |
testcase_28 | RE | - |
ソースコード
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. return inf if the vertex is unreachable.""" return self.C[i] 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 is reachable from start""" 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, M = readints() edges = [tuple(readints()) for _ in range(M)] T = readlist() L = 10000 E = [[] for _ in range(N * (L + 1))] for a, b, c in edges: a -= 1 b -= 1 def h(i, t): return i * (L + 1) + t if a != N - 1: for j in range(L + 1): if j + T[a] > L: break cost = T[a] + c // (j + T[a]) E[h(a, j)].append((cost, h(b, j + T[a]))) if b != N - 1: for j in range(L + 1): if j + T[b] > L: break cost = T[b] + c // (j + T[b]) E[h(b, j)].append((cost, h(a, j + T[b]))) solver = Dijkstra(N * (L + 1), E) ans = solver.inf for j in range(L + 1): ans = min(ans, solver.get_cost((N - 1) * (L + 1) + j)) print(ans)