結果

問題 No.807 umg tours
ユーザー ikdikd
提出日時 2019-03-22 23:04:14
言語 Nim
(2.0.2)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,730 bytes
コンパイル時間 5,495 ms
コンパイル使用メモリ 68,232 KB
実行使用メモリ 68,352 KB
最終ジャッジ日時 2024-05-02 23:32:19
合計ジャッジ時間 17,401 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
12,320 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 3 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 539 ms
30,696 KB
testcase_12 AC 493 ms
44,032 KB
testcase_13 AC 557 ms
36,608 KB
testcase_14 AC 249 ms
22,400 KB
testcase_15 AC 221 ms
17,792 KB
testcase_16 AC 719 ms
51,968 KB
testcase_17 AC 1,252 ms
68,352 KB
testcase_18 AC 933 ms
55,168 KB
testcase_19 AC 809 ms
46,336 KB
testcase_20 AC 330 ms
19,840 KB
testcase_21 AC 340 ms
20,416 KB
testcase_22 AC 134 ms
10,624 KB
testcase_23 AC 106 ms
8,832 KB
testcase_24 TLE -
testcase_25 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

type HeapQueue*[T] = distinct seq[T]

proc newHeapQueue*[T](): HeapQueue[T] {.inline.} = HeapQueue[T](newSeq[T]())
proc newHeapQueue*[T](h: var HeapQueue[T]) {.inline.} = h = HeapQueue[T](
  newSeq[T]())

proc len*[T](h: HeapQueue[T]): int {.inline.} = seq[T](h).len
proc `[]`*[T](h: HeapQueue[T], i: int): T {.inline.} = seq[T](h)[i]
proc `[]=`[T](h: var HeapQueue[T], i: int,
  v: T) {.inline.} = seq[T](h)[i] = v
proc add[T](h: var HeapQueue[T], v: T) {.inline.} = seq[T](h).add(v)

proc heapCmp[T](x, y: T): bool {.inline.} =
  return (x < y)

# 'heap' is a heap at all indices >= startpos, except possibly for pos.  pos
# is the index of a leaf with a possibly out-of-order value.  Restore the
# heap invariant.
proc siftdown[T](heap: var HeapQueue[T], startpos, p: int) =
  var pos = p
  var newitem = heap[pos]
  # Follow the path to the root, moving parents down until finding a place
# newitem fits.
  while pos > startpos:
    let parentpos = (pos - 1) shr 1
    let parent = heap[parentpos]
    if heapCmp(newitem, parent):
      heap[pos] = parent
      pos = parentpos
    else:
      break
  heap[pos] = newitem

proc siftup[T](heap: var HeapQueue[T], p: int) =
  let endpos = len(heap)
  var pos = p
  let startpos = pos
  let newitem = heap[pos]
  # Bubble up the smaller child until hitting a leaf.
  var childpos = 2*pos + 1    # leftmost child position
  while childpos < endpos:
    # Set childpos to index of smaller child.
    let rightpos = childpos + 1
    if rightpos < endpos and not heapCmp(heap[childpos], heap[rightpos]):
      childpos = rightpos
    # Move the smaller child up.
    heap[pos] = heap[childpos]
    pos = childpos
    childpos = 2*pos + 1
  # The leaf at pos is empty now.  Put newitem there, and bubble it up
# to its final resting place (by sifting its parents down).
  heap[pos] = newitem
  siftdown(heap, startpos, pos)

proc push*[T](heap: var HeapQueue[T], item: T) =
  ## Push item onto heap, maintaining the heap invariant.
  (seq[T](heap)).add(item)
  siftdown(heap, 0, len(heap)-1)

proc pop*[T](heap: var HeapQueue[T]): T =
  ## Pop the smallest item off the heap, maintaining the heap invariant.
  let lastelt = seq[T](heap).pop()
  if heap.len > 0:
    result = heap[0]
    heap[0] = lastelt
    siftup(heap, 0)
  else:
    result = lastelt

# https://github.com/nim-lang/Nim/blob/master/lib/pure/collections/heapqueue.nim
# ---------------------------------------------------------------------------------------------- #
# ---------------------------------------------------------------------------------------------- #

import strutils, sequtils, math

proc `<`[T](a, b: T): bool {.inline.} =
  return a.dist < b.dist

proc main() =
  let
    nm = stdin.readLine.strip.split.map(parseInt)
    (n, m) = (nm[0], nm[1])
    abci = (0..<m).mapIt(stdin.readLine.strip.split.map(parseInt))

  type Edge = object
    to: int
    cost: int64
  var g = newSeqWith(n, newSeq[Edge]())
  for abc in abci:
    g[abc[0] - 1].add(Edge(to: abc[1] - 1, cost: abc[2]))
    g[abc[1] - 1].add(Edge(to: abc[0] - 1, cost: abc[2]))
  type T = object
    node: int
    dist: int64
    used: int
  var
    q = newHeapQueue[T]()
    dist = newSeqWith(n, newSeqWith(2, 100000000000000000))
  dist[0][0] = 0
  dist[0][1] = 0
  q.add(T(node: 0, dist: 0, used: 0))
  while q.len > 0:
    let cur = q.pop
    for e in g[cur.node]:
      if cur.dist + e.cost < dist[e.to][cur.used]:
        dist[e.to][cur.used] = cur.dist + e.cost
        q.add(T(node: e.to, dist: dist[e.to][cur.used], used: cur.used))
      if (cur.used == 0) and (cur.dist < dist[e.to][1]):
        dist[e.to][1] = cur.dist
        q.add(T(node: e.to, dist: dist[e.to][1], used: 1))
  for i in 0..<n:
    echo dist[i].sum

main()
0