結果
問題 | No.1767 BLUE to RED |
ユーザー | tenten |
提出日時 | 2023-04-18 11:43:46 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,257 ms / 2,000 ms |
コード長 | 3,502 bytes |
コンパイル時間 | 3,992 ms |
コンパイル使用メモリ | 92,904 KB |
実行使用メモリ | 87,996 KB |
最終ジャッジ日時 | 2024-04-21 11:15:03 |
合計ジャッジ時間 | 21,348 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
36,736 KB |
testcase_01 | AC | 47 ms
37,116 KB |
testcase_02 | AC | 46 ms
36,776 KB |
testcase_03 | AC | 48 ms
37,196 KB |
testcase_04 | AC | 75 ms
37,896 KB |
testcase_05 | AC | 84 ms
38,128 KB |
testcase_06 | AC | 49 ms
37,064 KB |
testcase_07 | AC | 86 ms
38,280 KB |
testcase_08 | AC | 86 ms
38,456 KB |
testcase_09 | AC | 761 ms
68,556 KB |
testcase_10 | AC | 899 ms
77,788 KB |
testcase_11 | AC | 803 ms
69,568 KB |
testcase_12 | AC | 743 ms
66,488 KB |
testcase_13 | AC | 879 ms
78,164 KB |
testcase_14 | AC | 1,171 ms
85,404 KB |
testcase_15 | AC | 1,165 ms
85,044 KB |
testcase_16 | AC | 1,131 ms
84,256 KB |
testcase_17 | AC | 1,257 ms
87,824 KB |
testcase_18 | AC | 1,185 ms
82,468 KB |
testcase_19 | AC | 1,094 ms
83,480 KB |
testcase_20 | AC | 1,140 ms
87,856 KB |
testcase_21 | AC | 1,152 ms
87,996 KB |
testcase_22 | AC | 1,157 ms
87,792 KB |
testcase_23 | AC | 1,119 ms
84,336 KB |
ソースコード
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(); int m = sc.nextInt(); TreeSet<Integer> reds = new TreeSet<>(); for (int i = 0; i < n; i++) { reds.add(sc.nextInt()); } reds.add(Integer.MIN_VALUE / 2); reds.add(Integer.MAX_VALUE); PriorityQueue<Bridge> queue = new PriorityQueue<>(); int prev = 0; for (int i = 1; i <= m; i++) { int x = sc.nextInt(); queue.add(new Bridge(0, i, x - reds.floor(x))); queue.add(new Bridge(0, i, reds.ceiling(x) - x)); if (i > 1) { queue.add(new Bridge(i - 1, i, x - prev)); } prev = x; } UnionFindTree uft = new UnionFindTree(m + 1); long ans = 0; while (queue.size() > 0) { ans += uft.unite(queue.poll()); } System.out.println(ans); } static class Bridge implements Comparable<Bridge> { int left; int right; int value; public Bridge(int left, int right, int value) { this.left = left; this.right = right; this.value = value; } public int compareTo(Bridge another) { return value - another.value; } } 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 parents[x]; } else { return parents[x] = find(parents[x]); } } public boolean same(Bridge b) { return find(b.left) == find(b.right); } public int unite(Bridge b) { if (same(b)) { return 0; } else { parents[find(b.right)] = find(b.left); return b.value; } } } } 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(); } }