結果

問題 No.1344 Typical Shortest Path Sum
ユーザー dot_haraaidot_haraai
提出日時 2021-05-31 00:31:07
言語 Nim
(2.0.2)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 1,199 bytes
コンパイル時間 5,086 ms
コンパイル使用メモリ 89,488 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-26 07:58:01
合計ジャッジ時間 5,494 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 1 ms
6,940 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 1 ms
6,944 KB
testcase_19 AC 2 ms
6,944 KB
testcase_20 AC 2 ms
6,944 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 1 ms
6,940 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 1 ms
6,940 KB
testcase_28 AC 2 ms
6,944 KB
testcase_29 AC 2 ms
6,944 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 1 ms
6,944 KB
testcase_32 AC 1 ms
6,944 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 1 ms
6,940 KB
testcase_35 AC 1 ms
6,940 KB
testcase_36 AC 1 ms
6,944 KB
testcase_37 AC 2 ms
6,944 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,940 KB
testcase_40 AC 11 ms
6,944 KB
testcase_41 AC 12 ms
6,940 KB
testcase_42 AC 10 ms
6,944 KB
testcase_43 AC 9 ms
6,940 KB
testcase_44 AC 10 ms
6,940 KB
testcase_45 AC 11 ms
6,944 KB
testcase_46 AC 12 ms
6,944 KB
testcase_47 AC 11 ms
6,944 KB
testcase_48 AC 12 ms
6,940 KB
testcase_49 AC 10 ms
6,944 KB
testcase_50 AC 10 ms
6,944 KB
testcase_51 AC 11 ms
6,944 KB
testcase_52 AC 9 ms
6,940 KB
testcase_53 AC 12 ms
6,940 KB
testcase_54 AC 10 ms
6,944 KB
testcase_55 AC 10 ms
6,944 KB
testcase_56 AC 11 ms
6,940 KB
testcase_57 AC 10 ms
6,940 KB
testcase_58 AC 12 ms
6,940 KB
testcase_59 AC 11 ms
6,944 KB
testcase_60 AC 2 ms
6,944 KB
testcase_61 AC 2 ms
6,940 KB
testcase_62 AC 3 ms
6,940 KB
testcase_63 AC 2 ms
6,944 KB
testcase_64 AC 2 ms
6,944 KB
testcase_65 AC 3 ms
6,940 KB
testcase_66 AC 3 ms
6,940 KB
testcase_67 AC 3 ms
6,940 KB
testcase_68 AC 2 ms
6,944 KB
testcase_69 AC 2 ms
6,940 KB
testcase_70 AC 2 ms
6,940 KB
testcase_71 AC 1 ms
6,940 KB
testcase_72 AC 1 ms
6,944 KB
testcase_73 AC 1 ms
6,940 KB
testcase_74 AC 1 ms
6,940 KB
testcase_75 AC 2 ms
6,940 KB
testcase_76 AC 1 ms
6,940 KB
testcase_77 AC 2 ms
6,940 KB
testcase_78 AC 2 ms
6,944 KB
testcase_79 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(2)))
    touch = newseqwith(n,newseqwith(n,false))
  for i in 0..<m:
    var
      (a,b,dist) = (scan()-1,scan()-1,scan())
    d[a][b].min=dist
    touch[a][b] = true

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


  proc warshall_floyd()=
    
    for k in 0..<n:
      for i in 0..<n:
        for j in 0..<n:
          touch[i][j] = touch[i][j] or (touch[i][k] and touch[k][j])
          d[i][j]=min(d[i][j],d[i][k]+d[k][j])
  warshall_floyd()
  for i in 0..<n:
    var t = 0
    for j in 0..<n:
      if touch[i][j]:t+=d[i][j]
    echo t


  
solve()
0