結果
問題 | No.2354 Poor Sight in Winter |
ユーザー | tenten |
提出日時 | 2024-04-03 13:06:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 858 ms / 2,000 ms |
コード長 | 3,164 bytes |
コンパイル時間 | 3,819 ms |
コンパイル使用メモリ | 79,516 KB |
実行使用メモリ | 71,288 KB |
最終ジャッジ日時 | 2024-04-03 13:07:02 |
合計ジャッジ時間 | 14,028 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
54,092 KB |
testcase_01 | AC | 54 ms
54,124 KB |
testcase_02 | AC | 55 ms
54,084 KB |
testcase_03 | AC | 54 ms
54,116 KB |
testcase_04 | AC | 56 ms
54,092 KB |
testcase_05 | AC | 54 ms
54,116 KB |
testcase_06 | AC | 55 ms
54,092 KB |
testcase_07 | AC | 54 ms
54,128 KB |
testcase_08 | AC | 55 ms
54,084 KB |
testcase_09 | AC | 55 ms
54,096 KB |
testcase_10 | AC | 69 ms
54,096 KB |
testcase_11 | AC | 759 ms
71,288 KB |
testcase_12 | AC | 326 ms
67,900 KB |
testcase_13 | AC | 829 ms
70,876 KB |
testcase_14 | AC | 833 ms
71,008 KB |
testcase_15 | AC | 735 ms
67,516 KB |
testcase_16 | AC | 777 ms
70,740 KB |
testcase_17 | AC | 858 ms
68,500 KB |
testcase_18 | AC | 290 ms
61,408 KB |
testcase_19 | AC | 599 ms
69,920 KB |
testcase_20 | AC | 425 ms
62,260 KB |
testcase_21 | AC | 110 ms
56,012 KB |
testcase_22 | AC | 304 ms
61,680 KB |
testcase_23 | AC | 280 ms
61,776 KB |
testcase_24 | AC | 504 ms
63,724 KB |
testcase_25 | AC | 222 ms
61,356 KB |
testcase_26 | AC | 186 ms
60,736 KB |
testcase_27 | AC | 85 ms
55,252 KB |
testcase_28 | AC | 102 ms
55,632 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int k = sc.nextInt(); Point[] points = new Point[n + 2]; for (int i = 0; i < n + 2; i++) { points[i] = new Point(sc.nextInt(), sc.nextInt()); } int[][] distances = new int[n + 2][n + 2]; for (int i = 0; i < n + 2; i++) { for (int j = i + 1; j < n + 2; j++) { distances[i][j] = points[i].getDistance(points[j]); distances[j][i] = distances[i][j]; } } int left = 0; int right = 200000; PriorityQueue<Path> queue = new PriorityQueue<>(); int[] costs = new int[n + 2]; while (right - left > 1) { int m = (left + right) / 2; Arrays.fill(costs, Integer.MAX_VALUE); 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 + 2; i++) { if (costs[i] < Integer.MAX_VALUE) { continue; } queue.add(new Path(i, p.value + (distances[p.idx][i] - 1) / m)); } } if (costs[1] <= k) { right = m; } else { left = m; } } System.out.println(right); } static class Path implements Comparable<Path> { int idx; int value; public Path (int idx, int value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { return value - another.value; } } static class Point { int x; int y; public Point(int x, int y) { this.x = x; this.y = y; } public int getDistance(Point p) { return Math.abs(x - p.x) + Math.abs(y - p.y); } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }