結果

問題 No.2569 はじめてのおつかいHard
ユーザー tenten
提出日時 2023-12-13 15:07:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,318 ms / 2,000 ms
コード長 3,683 bytes
コンパイル時間 3,271 ms
コンパイル使用メモリ 91,792 KB
実行使用メモリ 109,628 KB
最終ジャッジ日時 2024-09-27 05:23:08
合計ジャッジ時間 17,136 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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();
int m = sc.nextInt();
ArrayList<ArrayList<Path>> graph = new ArrayList<>();
ArrayList<ArrayList<Path>> reverse = new ArrayList<>();
for (int i = 0; i < n; i++) {
graph.add(new ArrayList<>());
reverse.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
int c = sc.nextInt();
graph.get(a).add(new Path(b, c));
reverse.get(b).add(new Path(a, c));
}
long[] lastCost = getCost(n - 1, graph);
long[] lastReverse = getCost(n - 1, reverse);
long[] preCost = getCost(n - 2, graph);
long[] preReverse = getCost(n - 2, reverse);
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n - 2; i++) {
long ans = Math.min(lastReverse[i] + lastCost[n - 2] + preCost[i], preReverse[i] + preCost[n - 1] + lastCost[i]);
if (ans >= Long.MAX_VALUE / 3) {
ans = -1;
}
sb.append(ans).append("\n");
}
System.out.print(sb);
}
static long[] getCost(int start, ArrayList<ArrayList<Path>> graph) {
PriorityQueue<Path> queue = new PriorityQueue<>();
queue.add(new Path(start, 0));
long[] costs = new long[graph.size()];
Arrays.fill(costs, Long.MAX_VALUE / 3);
while (queue.size() > 0) {
Path p = queue.poll();
if (costs[p.idx] <= p.value) {
continue;
}
costs[p.idx] = p.value;
for (Path x : graph.get(p.idx)) {
queue.add(new Path(x.idx, x.value + p.value));
}
}
return costs;
}
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;
}
}
}
}
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