結果

問題 No.614 壊れたキャンパス
ユーザー tentententen
提出日時 2023-01-31 12:59:26
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,454 bytes
コンパイル時間 2,821 ms
コンパイル使用メモリ 96,556 KB
実行使用メモリ 197,692 KB
最終ジャッジ日時 2024-06-30 16:48:15
合計ジャッジ時間 10,676 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
57,080 KB
testcase_01 AC 54 ms
50,128 KB
testcase_02 AC 55 ms
50,492 KB
testcase_03 AC 55 ms
50,440 KB
testcase_04 WA -
testcase_05 AC 55 ms
50,564 KB
testcase_06 WA -
testcase_07 AC 55 ms
50,500 KB
testcase_08 TLE -
testcase_09 TLE -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
権限があれば一括ダウンロードができます

ソースコード

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>> floors = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            floors.add(new TreeMap<>());
        }
        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();
            floors.get(buils[i]).put(lefts[i], null);
            floors.get(buils[i] + 1).put(rights[i], null);
        }
        floors.get(0).put(s, null);
        floors.get(n - 1).put(t, null);
        int idx = 0;
        for (TreeMap<Integer, Integer> map : floors) {
            for (int x : map.keySet()) {
                map.put(x, idx++);
            }
        }
        ArrayList<ArrayList<Path>> graph = new ArrayList<>();
        for (int i = 0; i < idx; i++) {
            graph.add(new ArrayList<>());
        }
        for (TreeMap<Integer, Integer> map : floors) {
            int prev = -1;
            for (int x : map.keySet()) {
                if (prev != -1) {
                    int diff = x - prev;
                    graph.get(map.get(prev)).add(new Path(map.get(x), diff));
                    graph.get(map.get(x)).add(new Path(map.get(prev), diff));
                }
                prev = x;
            }
        }
        for (int i = 0; i < m; i++) {
            graph.get(floors.get(buils[i]).get(lefts[i])).add(new Path(floors.get(buils[i] + 1).get(rights[i]), 0));
            graph.get(floors.get(buils[i] + 1).get(rights[i])).add(new Path(floors.get(buils[i]).get(lefts[i]), 0));
        }
        int start = floors.get(0).get(s);
        int goal = floors.get(n - 1).get(t);
        PriorityQueue<Path> queue = new PriorityQueue<>();
        queue.add(new Path(start, 0));
        long[] costs = new long[idx];
        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));
            }
        }
        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