結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | 37zigen |
提出日時 | 2020-06-11 04:26:45 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 760 ms / 2,000 ms |
コード長 | 3,768 bytes |
コンパイル時間 | 2,396 ms |
コンパイル使用メモリ | 78,132 KB |
実行使用メモリ | 93,184 KB |
最終ジャッジ日時 | 2023-09-06 07:10:22 |
合計ジャッジ時間 | 26,388 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,680 KB |
testcase_01 | AC | 44 ms
49,724 KB |
testcase_02 | AC | 503 ms
73,384 KB |
testcase_03 | AC | 640 ms
84,396 KB |
testcase_04 | AC | 586 ms
84,096 KB |
testcase_05 | AC | 479 ms
84,880 KB |
testcase_06 | AC | 454 ms
84,764 KB |
testcase_07 | AC | 243 ms
63,328 KB |
testcase_08 | AC | 452 ms
93,184 KB |
testcase_09 | AC | 169 ms
57,012 KB |
testcase_10 | AC | 317 ms
71,336 KB |
testcase_11 | AC | 262 ms
64,472 KB |
testcase_12 | AC | 149 ms
56,124 KB |
testcase_13 | AC | 518 ms
69,320 KB |
testcase_14 | AC | 566 ms
79,304 KB |
testcase_15 | AC | 590 ms
83,096 KB |
testcase_16 | AC | 414 ms
65,520 KB |
testcase_17 | AC | 760 ms
81,632 KB |
testcase_18 | AC | 295 ms
59,652 KB |
testcase_19 | AC | 703 ms
81,364 KB |
testcase_20 | AC | 285 ms
58,972 KB |
testcase_21 | AC | 303 ms
61,936 KB |
testcase_22 | AC | 638 ms
82,696 KB |
testcase_23 | AC | 76 ms
51,980 KB |
testcase_24 | AC | 80 ms
51,964 KB |
testcase_25 | AC | 144 ms
56,328 KB |
testcase_26 | AC | 485 ms
67,976 KB |
testcase_27 | AC | 425 ms
65,904 KB |
testcase_28 | AC | 594 ms
79,088 KB |
testcase_29 | AC | 176 ms
56,584 KB |
testcase_30 | AC | 559 ms
81,328 KB |
testcase_31 | AC | 570 ms
74,004 KB |
testcase_32 | AC | 425 ms
66,340 KB |
testcase_33 | AC | 602 ms
81,608 KB |
testcase_34 | AC | 331 ms
62,524 KB |
testcase_35 | AC | 677 ms
83,172 KB |
testcase_36 | AC | 62 ms
50,656 KB |
testcase_37 | AC | 103 ms
53,196 KB |
testcase_38 | AC | 70 ms
52,092 KB |
testcase_39 | AC | 92 ms
53,228 KB |
testcase_40 | AC | 55 ms
49,728 KB |
testcase_41 | AC | 759 ms
92,852 KB |
testcase_42 | AC | 393 ms
65,344 KB |
testcase_43 | AC | 527 ms
76,148 KB |
testcase_44 | AC | 301 ms
61,188 KB |
testcase_45 | AC | 483 ms
77,092 KB |
testcase_46 | AC | 44 ms
49,544 KB |
testcase_47 | AC | 45 ms
49,600 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.PriorityQueue; public class Main { public static void main(String[] args) { new Main().run(); } final long MOD=998244353; class State implements Comparable<State>{ int v; double d; public State(int v,double d) { this.v=v; this.d=d; } @Override public int compareTo(State o) { return Double.compare(d, o.d); } } double dist(double x0,double y0,double x1,double y1) { double dx=x0-x1; double dy=y0-y1; return Math.sqrt(dx*dx+dy*dy); } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int M=sc.nextInt(); int X=sc.nextInt()-1; int Y=sc.nextInt()-1; double[] p=new double[N]; double[] q=new double[N]; for (int i=0;i<N;++i) { p[i]=sc.nextDouble(); q[i]=sc.nextDouble(); } ArrayList<Integer>[] g=new ArrayList[N]; for (int i=0;i<N;++i) g[i]=new ArrayList<>(); for (int i=0;i<M;++i) { int a=sc.nextInt()-1; int b=sc.nextInt()-1; g[a].add(b); g[b].add(a); } double[] dist=new double[N]; Arrays.fill(dist, Double.MAX_VALUE/3); dist[X]=0; PriorityQueue<State> pq=new PriorityQueue<>(); pq.add(new State(X,0)); while (!pq.isEmpty()) { State s=pq.poll(); if (dist[s.v]<s.d) continue; for (int dst:g[s.v]) { if (dist[dst]>dist[s.v]+dist(p[s.v],q[s.v],p[dst],q[dst])) { dist[dst]=dist[s.v]+dist(p[s.v],q[s.v],p[dst],q[dst]); pq.add(new State(dst, dist[dst])); } } } System.out.println(dist[Y]); } void tr(Object...o) {System.out.println(Arrays.deepToString(o));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }