結果

問題 No.614 壊れたキャンパス
ユーザー tentententen
提出日時 2023-06-15 08:51:43
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,306 bytes
コンパイル時間 2,766 ms
コンパイル使用メモリ 90,948 KB
実行使用メモリ 202,356 KB
最終ジャッジ日時 2023-09-05 15:08:28
合計ジャッジ時間 28,002 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,824 KB
testcase_01 AC 43 ms
49,704 KB
testcase_02 AC 43 ms
49,768 KB
testcase_03 AC 42 ms
49,728 KB
testcase_04 AC 44 ms
49,704 KB
testcase_05 AC 43 ms
49,708 KB
testcase_06 AC 44 ms
49,876 KB
testcase_07 AC 43 ms
51,820 KB
testcase_08 TLE -
testcase_09 TLE -
testcase_10 AC 1,609 ms
180,896 KB
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 AC 1,738 ms
160,024 KB
testcase_16 AC 1,952 ms
195,712 KB
testcase_17 AC 1,352 ms
195,400 KB
testcase_18 AC 1,637 ms
157,512 KB
testcase_19 AC 1,352 ms
154,808 KB
権限があれば一括ダウンロードができます

ソースコード

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();
        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));
        }
        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();
    }
    
}
0