結果

問題 No.2569 はじめてのおつかいHard
ユーザー tenten
提出日時 2023-12-04 18:34:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,613 ms / 2,000 ms
コード長 4,250 bytes
コンパイル時間 2,998 ms
コンパイル使用メモリ 92,340 KB
実行使用メモリ 103,356 KB
最終ジャッジ日時 2024-09-26 23:08:45
合計ジャッジ時間 17,930 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));
}
PriorityQueue<Path> queue = new PriorityQueue<>();
int[] starts = new int[]{n - 2, n - 1};
long[][] costs = new long[2][n];
for (int i = 0; i < 2; i++) {
Arrays.fill(costs[i], Long.MAX_VALUE / 3);
queue.add(new Path(starts[i], 0));
while (queue.size() > 0) {
Path p = queue.poll();
if (costs[i][p.idx] <= p.value) {
continue;
}
costs[i][p.idx] = p.value;
for (Path x : graph.get(p.idx)) {
queue.add(new Path(x.idx, p.value + x.value));
}
}
}
long[][] rcosts = new long[2][n];
for (int i = 0; i < 2; i++) {
Arrays.fill(rcosts[i], Long.MAX_VALUE / 3);
queue.add(new Path(starts[i], 0));
while (queue.size() > 0) {
Path p = queue.poll();
if (rcosts[i][p.idx] <= p.value) {
continue;
}
rcosts[i][p.idx] = p.value;
for (Path x : reverse.get(p.idx)) {
queue.add(new Path(x.idx, p.value + x.value));
}
}
}
long[] ans = new long[n - 2];
for (int i = 0; i < n - 2; i++) {
long strait = rcosts[0][i] + costs[0][n - 1] + costs[1][i];
long updown = rcosts[1][i] + costs[1][n - 2] + costs[0][i];
long tmp = Math.min(strait, updown);
if (tmp >= Long.MAX_VALUE / 3) {
ans[i] = -1;
} else {
ans[i] = tmp;
}
}
System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));
}
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