結果

問題 No.2179 Planet Traveler
ユーザー tentententen
提出日時 2023-01-25 12:00:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 248 ms / 3,000 ms
コード長 4,395 bytes
コンパイル時間 5,157 ms
コンパイル使用メモリ 81,924 KB
実行使用メモリ 68,828 KB
最終ジャッジ日時 2023-09-08 23:41:22
合計ジャッジ時間 11,320 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,560 KB
testcase_01 AC 43 ms
49,728 KB
testcase_02 AC 44 ms
49,764 KB
testcase_03 AC 43 ms
49,588 KB
testcase_04 AC 43 ms
49,764 KB
testcase_05 AC 43 ms
49,600 KB
testcase_06 AC 44 ms
49,536 KB
testcase_07 AC 44 ms
47,752 KB
testcase_08 AC 48 ms
49,632 KB
testcase_09 AC 47 ms
49,664 KB
testcase_10 AC 47 ms
49,544 KB
testcase_11 AC 187 ms
66,972 KB
testcase_12 AC 203 ms
67,044 KB
testcase_13 AC 235 ms
66,544 KB
testcase_14 AC 186 ms
66,904 KB
testcase_15 AC 186 ms
66,868 KB
testcase_16 AC 185 ms
68,828 KB
testcase_17 AC 228 ms
66,688 KB
testcase_18 AC 233 ms
66,848 KB
testcase_19 AC 219 ms
66,988 KB
testcase_20 AC 107 ms
54,204 KB
testcase_21 AC 248 ms
62,964 KB
testcase_22 AC 179 ms
59,612 KB
testcase_23 AC 151 ms
59,680 KB
testcase_24 AC 186 ms
62,292 KB
testcase_25 AC 159 ms
59,400 KB
testcase_26 AC 185 ms
61,712 KB
testcase_27 AC 99 ms
53,988 KB
testcase_28 AC 159 ms
57,452 KB
testcase_29 AC 193 ms
61,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.stream.*;

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(), sc.nextInt());
        }
        PriorityQueue<Distance> queue = new PriorityQueue<>();
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                queue.add(new Distance(i, j, points[i].getDistance(points[j])));
            }
        }
        long current = 0;
        UnionFindTree uft = new UnionFindTree(n);
        while (!uft.same(0, n - 1)) {
            Distance x = queue.poll();
            uft.unite(x);
            current = x.value;
        }
        System.out.println(current);
    }
    
    static class UnionFindTree {
        int[] parents;
        
        public UnionFindTree(int size) {
            parents = new int[size];
            for (int i = 0; i < size; i++) {
                parents[i] = i;
            }
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public void unite(int x, int y) {
            if (!same(x, y)) {
                parents[find(x)] = find(y);
            }
        }
        
        public void unite(Distance x) {
            unite(x.left, x.right);
        }
    }
    
    static class Distance implements Comparable<Distance> {
        int left;
        int right;
        long value;
        
        public Distance(int left, int right, long value) {
            this.left = left;
            this.right = right;
            this.value = value;
        }
        
        public int compareTo(Distance another) {
            if (value == another.value) {
                return 0;
            } else if (value < another.value) {
                return -1;
            } else {
                return 1;
            }
        }
    }
    
    static class Point {
        long x;
        long y;
        int t;
        long r2;
        
        public Point(long x, long y, int t) {
            this.x = x;
            this.y = y;
            this.t = t;
            r2 = x * x + y * y;
        }
        
        public long getDistance(Point p) {
            if (t == p.t) {
                return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);
            } else {
                long ans = r2 + p.r2;
                long left = 0;
                long right = Integer.MAX_VALUE;
                while (right - left > 1) {
                    long m = (left + right) / 2;
                    if (m * m <= 4 * r2 * p.r2) {
                        left = m;
                    } else {
                        right = m;
                    }
                }
                return ans - left;
            }
        }
    }
    
}

class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    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 int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
0