結果
問題 | No.614 壊れたキャンパス |
ユーザー |
![]() |
提出日時 | 2023-06-15 08:32:50 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,352 bytes |
コンパイル時間 | 2,939 ms |
コンパイル使用メモリ | 85,076 KB |
実行使用メモリ | 193,576 KB |
最終ジャッジ日時 | 2024-06-23 10:29:14 |
合計ジャッジ時間 | 10,532 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 6 WA * 2 TLE * 2 -- * 10 |
ソースコード
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();int k = sc.nextInt();int s = sc.nextInt();int t = sc.nextInt();ArrayList<TreeMap<Integer, Integer>> places = new ArrayList<>();for (int i = 0; i < n; i++) {places.add(new TreeMap<>());}places.get(0).put(s, null);places.get(n - 1).put(t, null);int[] buils = new int[m];int[] lefts = new int[m];int[] rights = new int[m];for (int i = 0; i < m; i++) {buils[i] = sc.nextInt() - 1;lefts[i] = sc.nextInt();rights[i] = sc.nextInt();places.get(buils[i]).put(lefts[i], null);places.get(buils[i] + 1).put(rights[i], null);}int count = 0;for (TreeMap<Integer, Integer> x : places) {count += x.size();}ArrayList<ArrayList<Path>> graph = new ArrayList<>();for (int i = 0; i < count; i++) {graph.add(new ArrayList<>());}int idx = 0;for (TreeMap<Integer, Integer> x : places) {int prev = -1;for (int y : x.keySet()) {x.put(y, idx);if (prev >= 0) {graph.get(idx - 1).add(new Path(idx, y - prev));graph.get(idx).add(new Path(idx - 1, y - prev));}prev = y;idx++;}}for (int i = 0; i < m; i++) {int a = places.get(buils[i]).get(lefts[i]);int b = places.get(buils[i] + 1).get(rights[i]);graph.get(a).add(new Path(b, 0));graph.get(b).add(new Path(a, 0));}PriorityQueue<Path> queue = new PriorityQueue<>();queue.add(new Path(places.get(0).get(s), 0));long[] costs = new long[count];Arrays.fill(costs, Long.MAX_VALUE);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));}}int goal = places.get(n - 1).get(t);if (costs[goal] == Long.MAX_VALUE) {System.out.println(-1);} else {System.out.println(costs[goal]);}}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();}}