結果

問題 No.1344 Typical Shortest Path Sum
ユーザー dot_haraaidot_haraai
提出日時 2021-05-31 00:24:32
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 1,033 bytes
コンパイル時間 4,386 ms
コンパイル使用メモリ 87,168 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 21:04:59
合計ジャッジ時間 6,296 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 3
other WA * 48 RE * 29
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 44) Warning: imported and not used: 'heapqueue' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [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]
/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]

ソースコード

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()
    d = newseqwith(n,newseqwith(n,int.high.div(4)))
  for i in 0..<m:
    var
      (a,b,dist) = (scan()-1,scan()-1,scan())
    d[a][b].min=dist

  for i in 0..<n:
    d[i][i]=0


  proc warshall_floyd()=
    
    for k in 0..<n:
      for i in 0..<n:
        for j in 0..<n:
          d[i][j]=min(d[i][j],d[i][k]+d[k][j])
  warshall_floyd()
  echo d.join("\n")
  for i in 0..<n:
    echo d[i].filterIt(it!=int.high.div(4)).sum()


  
solve()
0