結果
| 問題 |
No.1065 電柱 / Pole (Easy)
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2020-05-29 22:13:14 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,196 ms / 2,000 ms |
| コード長 | 5,728 bytes |
| コンパイル時間 | 4,268 ms |
| コンパイル使用メモリ | 92,320 KB |
| 実行使用メモリ | 95,512 KB |
| 最終ジャッジ日時 | 2024-11-06 05:10:13 |
| 合計ジャッジ時間 | 35,676 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 46 |
ソースコード
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.stream.IntStream;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.OptionalInt;
import java.util.ArrayList;
import java.io.BufferedOutputStream;
import java.util.AbstractCollection;
import java.nio.charset.Charset;
import java.util.StringTokenizer;
import java.io.OutputStreamWriter;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.util.List;
import java.util.stream.Stream;
import java.io.Writer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author mikit
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
LightScanner in = new LightScanner(inputStream);
LightWriter out = new LightWriter(outputStream);
YC1065 solver = new YC1065();
solver.solve(1, in, out);
out.close();
}
static class YC1065 {
public void solve(int testNumber, LightScanner in, LightWriter out) {
int n = in.ints(), m = in.ints(), start = in.ints() - 1, goal = in.ints() - 1;
int[] px = new int[n], py = new int[n];
in.ints(px, py);
List<List<Integer>> adj = new ArrayList<>();
for (int i = 0; i < n; i++) adj.add(new ArrayList<>());
for (int i = 0; i < m; i++) {
int x = in.ints() - 1, y = in.ints() - 1;
adj.get(x).add(y);
adj.get(y).add(x);
}
double[] dist = new double[n];
Arrays.fill(dist, Double.MAX_VALUE);
PriorityQueue<Integer> q = new PriorityQueue<>(Comparator.comparing(x -> dist[x]));
dist[start] = 0;
q.offer(start);
while (!q.isEmpty()) {
int now = q.poll();
for (int nxt : adj.get(now)) {
double d = dist[now] + Math.hypot(px[now] - px[nxt], py[now] - py[nxt]);
if (dist[nxt] <= d) continue;
dist[nxt] = d;
q.offer(nxt);
}
}
out.ans(dist[goal], 10).ln();
}
}
static class LightWriter implements AutoCloseable {
private final Writer out;
private boolean autoflush = false;
private boolean breaked = true;
public LightWriter(Writer out) {
this.out = out;
}
public LightWriter(OutputStream out) {
this(new OutputStreamWriter(new BufferedOutputStream(out), Charset.defaultCharset()));
}
public LightWriter print(char c) {
try {
out.write(c);
breaked = false;
} catch (IOException ex) {
throw new UncheckedIOException(ex);
}
return this;
}
public LightWriter print(String s) {
try {
out.write(s, 0, s.length());
breaked = false;
} catch (IOException ex) {
throw new UncheckedIOException(ex);
}
return this;
}
public LightWriter ans(double x, int n) {
if (!breaked) {
print(' ');
}
if (x < 0) {
print('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
print(Long.toString((long) x)).print('.');
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
print((char) ('0' + ((int) x)));
x -= (int) x;
}
return this;
}
public LightWriter ln() {
print(System.lineSeparator());
breaked = true;
if (autoflush) {
try {
out.flush();
} catch (IOException ex) {
throw new UncheckedIOException(ex);
}
}
return this;
}
public void close() {
try {
out.close();
} catch (IOException ex) {
throw new UncheckedIOException(ex);
}
}
}
static class LightScanner implements AutoCloseable {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public LightScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
}
public String string() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new UncheckedIOException(e);
}
}
return tokenizer.nextToken();
}
public int ints() {
return Integer.parseInt(string());
}
public void ints(int[]... arrays) {
int l = Arrays.stream(arrays).mapToInt(a -> a.length).min().orElse(0);
for (int i = 0; i < l; i++) {
for (int j = 0; j < arrays.length; j++) {
arrays[j][i] = ints();
}
}
}
public void close() {
try {
this.reader.close();
} catch (IOException ex) {
throw new UncheckedIOException(ex);
}
}
}
}