結果

問題 No.860 買い物
ユーザー tentententen
提出日時 2023-01-31 16:41:46
言語 Java
(openjdk 23)
結果
AC  
実行時間 657 ms / 1,000 ms
コード長 3,370 bytes
コンパイル時間 2,773 ms
コンパイル使用メモリ 85,732 KB
実行使用メモリ 71,824 KB
最終ジャッジ日時 2024-06-30 19:03:36
合計ジャッジ時間 10,952 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

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();
ArrayList<Bridge> list = new ArrayList<>();
long total = 0;
for (int i = 0; i < n; i++) {
int c = sc.nextInt();
int d = sc.nextInt();
list.add(new Bridge(i, n, c));
total += c;
if (i > 0) {
list.add(new Bridge(i - 1, i, d));
}
}
Collections.sort(list);
UnionFindTree uft = new UnionFindTree(n + 1);
for (Bridge x : list) {
if (!uft.same(x)) {
uft.unite(x);
total += x.value;
}
}
System.out.println(total);
}
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 (parents[x] == x) {
return x;
} else {
return parents[x] = find(parents[x]);
}
}
public boolean same(int x, int y) {
return find(x) == find(y);
}
public boolean same(Bridge b) {
return same(b.left, b.right);
}
public void unite(int x, int y) {
if (!same(x, y)) {
parents[find(x)] = find(y);
}
}
public void unite(Bridge b) {
unite(b.left, b.right);
}
}
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;
}
}
}
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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0