結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー dot_haraaidot_haraai
提出日時 2021-06-13 12:14:24
言語 Nim
(2.0.2)
結果
AC  
実行時間 437 ms / 2,000 ms
コード長 1,491 bytes
コンパイル時間 7,366 ms
コンパイル使用メモリ 75,244 KB
実行使用メモリ 49,828 KB
最終ジャッジ日時 2023-08-24 13:24:13
合計ジャッジ時間 20,755 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 196 ms
26,700 KB
testcase_03 AC 271 ms
35,740 KB
testcase_04 AC 270 ms
34,652 KB
testcase_05 AC 240 ms
35,180 KB
testcase_06 AC 243 ms
35,820 KB
testcase_07 AC 73 ms
12,476 KB
testcase_08 AC 272 ms
38,304 KB
testcase_09 AC 24 ms
6,228 KB
testcase_10 AC 123 ms
18,820 KB
testcase_11 AC 85 ms
13,936 KB
testcase_12 AC 66 ms
13,224 KB
testcase_13 AC 211 ms
26,436 KB
testcase_14 AC 273 ms
34,940 KB
testcase_15 AC 309 ms
41,020 KB
testcase_16 AC 135 ms
15,904 KB
testcase_17 AC 332 ms
43,364 KB
testcase_18 AC 93 ms
12,228 KB
testcase_19 AC 312 ms
41,140 KB
testcase_20 AC 79 ms
13,204 KB
testcase_21 AC 115 ms
14,256 KB
testcase_22 AC 285 ms
36,764 KB
testcase_23 AC 5 ms
4,376 KB
testcase_24 AC 5 ms
4,380 KB
testcase_25 AC 61 ms
12,672 KB
testcase_26 AC 157 ms
24,528 KB
testcase_27 AC 157 ms
20,336 KB
testcase_28 AC 282 ms
32,960 KB
testcase_29 AC 32 ms
6,544 KB
testcase_30 AC 307 ms
39,420 KB
testcase_31 AC 218 ms
30,888 KB
testcase_32 AC 130 ms
21,652 KB
testcase_33 AC 303 ms
40,404 KB
testcase_34 AC 98 ms
13,112 KB
testcase_35 AC 312 ms
38,928 KB
testcase_36 AC 4 ms
4,380 KB
testcase_37 AC 5 ms
4,380 KB
testcase_38 AC 4 ms
4,380 KB
testcase_39 AC 5 ms
4,376 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 437 ms
49,828 KB
testcase_42 AC 122 ms
17,612 KB
testcase_43 AC 208 ms
27,664 KB
testcase_44 AC 73 ms
12,356 KB
testcase_45 AC 205 ms
27,096 KB
testcase_46 AC 2 ms
4,380 KB
testcase_47 AC 2 ms
4,376 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, 18) Warning: imported and not used: 'future' [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]

ソースコード

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():float=
  var
    n = scan()
    m = scan()
    x = scan()-1
    y = scan()-1
    pole = newseqwith(n,(scanf(),scanf()))
    es = newseqwith(n,newseq[int]())
    cs = newseqwith(n,newseq[int]())

  for i in 0..<m:
    var
      p = scan()-1
      q = scan()-1
      dist = (sqrt((pole[p][0]-pole[q][0])^2+(pole[p][1]-pole[q][1])^2)*1E8).toInt()
    es[p].add(q)
    cs[p].add(dist)
    es[q].add(p)
    cs[q].add(dist)

  var
    dist = newseqwith(n,int.high.div(4))
  proc dijkstra(s:int)=
    dist[s]=0
    var
      q = initHeapQueue[(int,int)]()
    q.push((0,s))
    while q.len>0:
      var
        (c,p) = q.pop()

      if dist[p]<c:continue
      else:
        for ni in 0..<es[p].len:
          var
            nxt = es[p][ni]
            cst = cs[p][ni]
          if dist[p]+cst < dist[nxt]:
            dist[nxt]=dist[p]+cst
            q.push((dist[nxt],nxt))
  dijkstra(x)
  return dist[y].float/1E8


    


  
echo solve()
0