結果
問題 | No.168 ものさし |
ユーザー | tenten |
提出日時 | 2021-11-10 15:41:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 367 ms / 2,000 ms |
コード長 | 2,892 bytes |
コンパイル時間 | 2,059 ms |
コンパイル使用メモリ | 79,392 KB |
実行使用メモリ | 70,884 KB |
最終ジャッジ日時 | 2024-05-01 03:11:17 |
合計ジャッジ時間 | 6,706 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 168 ms
58,056 KB |
testcase_01 | AC | 52 ms
49,996 KB |
testcase_02 | AC | 51 ms
50,364 KB |
testcase_03 | AC | 50 ms
50,380 KB |
testcase_04 | AC | 50 ms
50,212 KB |
testcase_05 | AC | 50 ms
50,440 KB |
testcase_06 | AC | 49 ms
50,456 KB |
testcase_07 | AC | 48 ms
50,340 KB |
testcase_08 | AC | 49 ms
50,500 KB |
testcase_09 | AC | 64 ms
50,176 KB |
testcase_10 | AC | 82 ms
51,844 KB |
testcase_11 | AC | 166 ms
58,136 KB |
testcase_12 | AC | 291 ms
62,808 KB |
testcase_13 | AC | 364 ms
70,600 KB |
testcase_14 | AC | 355 ms
70,668 KB |
testcase_15 | AC | 49 ms
50,560 KB |
testcase_16 | AC | 62 ms
50,500 KB |
testcase_17 | AC | 74 ms
51,644 KB |
testcase_18 | AC | 112 ms
52,148 KB |
testcase_19 | AC | 335 ms
64,428 KB |
testcase_20 | AC | 364 ms
70,884 KB |
testcase_21 | AC | 367 ms
70,752 KB |
testcase_22 | AC | 351 ms
70,816 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); Point[] points = new Point[n]; for (int i = 0; i < n; i++) { points[i] = new Point(sc.nextInt(), sc.nextInt()); } long[] costs = new long[n]; Arrays.fill(costs, Long.MAX_VALUE); PriorityQueue<Path> queue = new PriorityQueue<>(); queue.add(new Path(0, 0)); while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.idx] <= p.value) { continue; } costs[p.idx] = p.value; for (int i = 0; i < n; i++) { if (costs[i] < Long.MAX_VALUE) { continue; } queue.add(new Path(i, Math.max(p.value, points[p.idx].getDistance(points[i])))); } } long left = 0; long right = Integer.MAX_VALUE / 10; while (right - left > 1) { long m = (left + right) / 2; if (m * m * 100 < costs[n - 1]) { left = m; } else { right = m; } } System.out.println(right * 10); } static class Path implements Comparable<Path> { int idx; long value; public Path(int idx, long value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } static class Point { long x; long y; public Point(long x, long y) { this.x = x; this.y = y; } public long getDistance(Point another) { return (x - another.x) * (x - another.x) + (y - another.y) * (y - another.y); } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String nextLine() throws Exception { return br.readLine(); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }