結果

問題 No.1344 Typical Shortest Path Sum
ユーザー dot_haraaidot_haraai
提出日時 2021-05-31 00:10:40
言語 Nim
(2.2.0)
結果
MLE  
実行時間 -
コード長 1,437 bytes
コンパイル時間 6,019 ms
コンパイル使用メモリ 88,960 KB
実行使用メモリ 817,152 KB
最終ジャッジ日時 2024-11-08 21:04:51
合計ジャッジ時間 8,747 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 59 MLE * 1 -- * 17
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    n = scan()
    m = scan()
    #neib = newseqwith(n,newseqwith(n,int.high))
    es = newseqwith(n,newseq[(int,int)]())
    cs = newseqwith(n,newseq[int]())
    touch = newseqwith(n,false)
    dist = newseqwith(n,int.high)
  for i in 0..<m:
    var
      (a,b,d) = (scan()-1,scan()-1,scan())
    #neib[a][b].min=d
    es[a].add((d,b))
    #cs[a].add(d)
  es.applyIt(it.sorted(SortOrder.Ascending))
  proc bfs(s:int):int=
    touch.fill(false)
    dist.fill(int.high)
    var
      q = initHeapQueue[(int,int)]()
    q.push((s,0))
    while q.len>0:
      var
        (p,cost) = q.pop()
      if dist[p] <= cost:continue
      dist[p]=cost
      touch[p]=true
      for (ncost,nxt) in es[p]:
        if dist[nxt] > cost+ncost:
          q.push((nxt,cost+ncost))
    for (t,c) in zip(touch,dist):
      if t:
        result+=c
    
  for i in 0..<n:
    echo bfs(i)
  
solve()
0