提出 #63278866

---

ソースコード 拡げる

import java.io.IOException;
import java.io.InputStream;
import java.util.*;

class Main {
    static ArrayList<Edge>[] outG;
    static ArrayList<Edge>[] inG;
    static int N;
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        
        N = sc.nextInt();
        int M = sc.nextInt();
        int X = sc.nextInt();

        inG = new ArrayList[2*N+1];
        outG = new ArrayList[2*N+1];
        for (int i = 0; i <= 2*N; i++) {
            inG[i] = new ArrayList<>();
            outG[i] = new ArrayList<>();
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            outG[a].add(new Edge(b,1));
            outG[a].add(new Edge(N+a,X));
            outG[N + a].add(new Edge(a,X));

            outG[b].add(new Edge(N+b,X));
            outG[b+N].add(new Edge(b,X));
            outG[N + b].add(new Edge(N+a,1));
        }

        dijkstra(1);
        System.out.println(Math.min(dist[N],dist[2*N]));

        MyWriter.flush();
    }

    static long[] dist;
    //ダイクストラ法
    private static void dijkstra(int s){
        final long INF = 9000000000000000000L;
        boolean[] kakutei = new boolean[2*N + 1]; // Java では new で初期化した配列の要素は false になることに注意
        dist = new long[2*N + 1];
        Arrays.fill(dist, INF);
        // スタート地点をキューに追加
        dist[s] = 0;
        Queue<State> Q = new PriorityQueue<>();
        Q.add(new State(dist[s], 1));

        // ダイクストラ法
        while (Q.size() >= 1) {
            // 次に確定させるべき頂点を求める
            // （ここでは、優先度付きキュー Q の最小要素を取り出し、これを Q から削除する）
            int pos = Q.remove().pos;

            // Q の最小要素が「既に確定した頂点」の場合
            if (kakutei[pos]) {
                continue;
            }

            // cur[x] の値を更新する
            kakutei[pos] = true;
            for (int i = 0; i < outG[pos].size(); i++) {
                Edge e = outG[pos].get(i);
                if (dist[e.to] > dist[pos] + e.cost) {
                    dist[e.to] = dist[pos] + e.cost;
                    Q.add(new State(dist[e.to], e.to));
                }
            }
        }
        //たどりつけない辺を-1に
        for (int i = 1; i <= N; i++) {
            if (dist[i] == INF){
                dist[i] = -1;
            }
        }
    }

    static class State implements Comparable<State> {
        int pos;
        long dist;
        public State(long dist, int pos) {
            this.dist = dist;
            this.pos = pos;
        }
        @Override public int compareTo(State s) {
            // State 型同士の比較をする関数
            if (this.dist < s.dist) {
                return -1;
            }
            if (this.dist > s.dist) {
                return 1;
            }
            return 0;
        }
    }

    static class Edge {
        int to, cost; // 行き先 to、長さ cost
        public Edge(int to, int cost) {
            this.to = to;
            this.cost = cost;
        }
    }

    private static class MyWriter{
        static StringBuilder sb = new StringBuilder();
        protected static void flush(){
            System.out.print(sb);
            sb = new StringBuilder();
        }
        protected static void println(){
            sb.append("\n");
        }
        protected static void println(int i){
            sb.append(i).append("\n");
        }
        protected static void println(long l) {
            sb.append(l).append("\n");
        }
        protected static void println(double d) {
            sb.append(d).append("\n");
        }
        protected static void println(float f) {
            sb.append(f).append("\n");
        }
        protected static void println(char c) {
            sb.append(c).append("\n");
        }
        protected static void println(boolean b) {
            sb.append(b).append("\n");
        }
        protected static void println(Object obj) {
            String s = String.valueOf(obj);
            sb.append(s).append("\n");
        }
        protected static void print(int i){
            sb.append(i);
        }
        protected static void print(long l) {
            sb.append(l);
        }
        protected static void print(double d) {
            sb.append(d);
        }
        protected static void print(float f) {
            sb.append(f);
        }
        protected static void print(char c) {
            sb.append(c);
        }
        protected static void print(boolean b) {
            sb.append(b);
        }
        protected static void print(Object obj) {
            String s = String.valueOf(obj);
            sb.append(s);
        }

        protected static void printInv(long a,long b,long MOD){
            a %= MOD;
            b %= MOD;
            println((a * invGcd(b,MOD)[1])%MOD);
        }
        private static long safeMod(long x, long m){
            x %= m;
            if(x<0) x += m;
            return x;
        }
        private static long[] invGcd(long a, long b){
            a = safeMod(a, b);
            if(a==0) return new long[]{b,0};

            long s=b, t=a;
            long m0=0, m1=1;
            while(t>0){
                long u = s/t;
                s -= t*u;
                m0 -= m1*u;
                long tmp = s; s = t; t = tmp;
                tmp = m0; m0 = m1; m1 = tmp;
            }
            if(m0<0) m0 += b/s;
            return new long[]{s,m0};
        }
        public static long writerGcd(long... a){
            if(a.length == 0) return 0;
            long r = Math.abs(a[0]);
            for(int i=1; i<a.length; i++){
                if(a[i]!=0) {
                    if(r==0) r = Math.abs(a[i]);
                    else r = invGcd(r, Math.abs(a[i]))[0];
                }
            }
            return r;
        }
    }

    private static class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                return buflen > 0;
            }
        }

        private int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
            return !hasNextByte();
        }

        public String next() {
            if (hasNext()) throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public long nextLong() {
            if (hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) {
                    return minus ? -n : n;
                } else {
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }

        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

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

提出情報

コンパイルエラー

Note: Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

ジャッジ結果