結果

問題 No.807 umg tours
ユーザー neko_the_shadowneko_the_shadow
提出日時 2020-10-23 15:37:09
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 7,413 bytes
コンパイル時間 3,536 ms
コンパイル使用メモリ 89,604 KB
実行使用メモリ 121,684 KB
最終ジャッジ日時 2023-09-28 15:26:14
合計ジャッジ時間 32,516 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 105 ms
53,148 KB
testcase_01 AC 106 ms
53,224 KB
testcase_02 AC 117 ms
54,080 KB
testcase_03 AC 111 ms
53,316 KB
testcase_04 AC 96 ms
53,044 KB
testcase_05 AC 103 ms
53,180 KB
testcase_06 AC 147 ms
56,420 KB
testcase_07 AC 111 ms
53,304 KB
testcase_08 AC 76 ms
51,764 KB
testcase_09 AC 85 ms
51,460 KB
testcase_10 AC 87 ms
51,432 KB
testcase_11 AC 1,616 ms
94,612 KB
testcase_12 AC 1,463 ms
100,288 KB
testcase_13 AC 1,681 ms
100,800 KB
testcase_14 AC 1,041 ms
80,268 KB
testcase_15 AC 901 ms
74,436 KB
testcase_16 AC 1,854 ms
97,264 KB
testcase_17 AC 2,084 ms
121,684 KB
testcase_18 AC 2,058 ms
120,764 KB
testcase_19 AC 1,902 ms
118,860 KB
testcase_20 AC 1,398 ms
96,456 KB
testcase_21 AC 1,446 ms
96,972 KB
testcase_22 AC 834 ms
73,548 KB
testcase_23 AC 714 ms
68,852 KB
testcase_24 TLE -
testcase_25 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.lang.reflect.Array;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.regex.Pattern;
import java.util.stream.Collectors;

public class Main {
    public void exec() {
        int n = stdin.nextInt();
        int m = stdin.nextInt();
        Dijkstra2 dijkstra2 = new Dijkstra2(n);
        for (int i = 0; i < m; i++) {
            int a = stdin.nextInt() - 1;
            int b = stdin.nextInt() - 1;
            long c = stdin.nextLong();
            dijkstra2.add(a, b, c);
            dijkstra2.add(b, a, c);
        }
        long[][] result = dijkstra2.run(0);
        for (int i = 0; i < n; i++) {
            stdout.println(result[0][i] + result[1][i]);
        }
    }

    public class Dijkstra2 {
        private int n;
        private Map<Integer, List<Edge>> edges;

        public Dijkstra2(int n) {
            this.n = n;
            this.edges = new HashMap<>();
        }

        public void add(int from, int to, long cost) {
            this.edges.computeIfAbsent(from, unused -> new ArrayList<>()).add(new Edge(from, to, cost));
        }

        public long[][] run(int start) {
            long[] score1 = new long[n];
            long[] score2 = new long[n];
            Arrays.fill(score1, Long.MAX_VALUE);
            Arrays.fill(score2, Long.MAX_VALUE);
            score1[start] = 0;
            score2[start] = 0;

            PriorityQueue<Tuple> q = new PriorityQueue<>();
            q.add(new Tuple(start, 0, false));
            q.add(new Tuple(start, 0, true));
            while (!q.isEmpty()) {
                Tuple t = q.remove();
                if (!edges.containsKey(t.current)) continue;
                for (Edge edge : edges.get(t.current)) {
                    int next = edge.to;
                    if (t.used) {
                        if (t.cost + edge.cost < score2[next]) {
                            score2[next] = t.cost + edge.cost;
                            q.add(new Tuple(next, score2[next], true));
                        }
                    } else {
                        if (t.cost + edge.cost < score1[next]) {
                            score1[next] = t.cost + edge.cost;
                            q.add(new Tuple(next, score1[next], false));
                        }
                        if (t.cost < score2[next]) {
                            score2[next] = t.cost;
                            q.add(new Tuple(next, score2[next], true));
                        }
                    }
                }
            }
            return new long[][] {score1, score2};
        }

        private class Edge {
            private int from;
            private int to;
            private long cost;

            public Edge(int from, int to, long cost) {
                this.from = from;
                this.to = to;
                this.cost = cost;
            }
        }

        private class Tuple implements Comparable<Tuple>{
            private int current;
            private long cost;
            private boolean used;

            public Tuple(int current, long cost, boolean used) {
                this.current = current;
                this.cost = cost;
                this.used = used;
            }

            @Override
            public int compareTo(Tuple other) {
                return Long.compare(this.cost, other.cost);
            }
        }
    }

    private static final Stdin stdin = new Stdin();
    private static final Stdout stdout = new Stdout();

    public static void main(String[] args) {
        try {
            new Main().exec();
        } finally {
            stdout.flush();
        }
    }

    public static class Stdin {
        private BufferedReader stdin;
        private Deque<String> tokens;
        private Pattern delim;

        public Stdin() {
            stdin = new BufferedReader(new InputStreamReader(System.in));
            tokens = new ArrayDeque<>();
            delim = Pattern.compile(" ");
        }

        public String nextString() {
            try {
                if (tokens.isEmpty()) {
                    String line = stdin.readLine();
                    if (line == null) {
                        throw new UncheckedIOException(new EOFException());
                    }
                    delim.splitAsStream(line).forEach(tokens::addLast);
                }
                return tokens.pollFirst();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

        public double nextDouble() {
            return Double.parseDouble(nextString());
        }

        public long nextLong() {
            return Long.parseLong(nextString());
        }

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            return a;
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        public double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++) a[i] = nextDouble();
            return a;
        }

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
    }

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout() {
            stdout =  new PrintWriter(System.out, false);
        }

        public void printf(String format, Object ... args) {
            String line = String.format(format, args);
            if (line.endsWith(System.lineSeparator())) {
                stdout.print(line);
            } else {
                stdout.println(line);
            }
        }

        public void println(Object ... objs) {
            String line = Arrays.stream(objs).map(Objects::toString).collect(Collectors.joining(" "));
            stdout.println(line);
        }

        public void printDebug(Object ... objs) {
            String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(" "));
            stdout.printf("DEBUG: %s%n", line);
            stdout.flush();
        }

        private String deepToString(Object o) {
            if (o == null) {
                return "null";
            }

            // 配列の場合
            if (o.getClass().isArray()) {
                int len = Array.getLength(o);
                String[] tokens = new String[len];
                for (int i = 0; i < len; i++) {
                    tokens[i] = deepToString(Array.get(o, i));
                }
                return "{" + String.join(",", tokens) + "}";
            }

            return Objects.toString(o);
        }

        private void flush() {
            stdout.flush();
        }
    }
}
0