結果

問題 No.1283 Extra Fee
ユーザー ywmtywmt
提出日時 2020-11-06 22:32:03
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,413 ms / 2,000 ms
コード長 6,646 bytes
コンパイル時間 2,495 ms
コンパイル使用メモリ 79,880 KB
実行使用メモリ 260,272 KB
最終ジャッジ日時 2023-08-10 06:02:55
合計ジャッジ時間 23,728 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,684 KB
testcase_01 AC 43 ms
49,624 KB
testcase_02 AC 44 ms
49,676 KB
testcase_03 AC 43 ms
49,476 KB
testcase_04 AC 42 ms
49,456 KB
testcase_05 AC 44 ms
49,464 KB
testcase_06 AC 45 ms
49,540 KB
testcase_07 AC 43 ms
49,472 KB
testcase_08 AC 46 ms
49,584 KB
testcase_09 AC 44 ms
49,596 KB
testcase_10 AC 43 ms
49,612 KB
testcase_11 AC 191 ms
59,892 KB
testcase_12 AC 209 ms
62,552 KB
testcase_13 AC 185 ms
59,900 KB
testcase_14 AC 400 ms
92,744 KB
testcase_15 AC 597 ms
110,824 KB
testcase_16 AC 198 ms
62,388 KB
testcase_17 AC 1,203 ms
183,928 KB
testcase_18 AC 1,405 ms
259,172 KB
testcase_19 AC 1,410 ms
260,272 KB
testcase_20 AC 1,413 ms
259,232 KB
testcase_21 AC 1,375 ms
256,604 KB
testcase_22 AC 1,400 ms
251,536 KB
testcase_23 AC 1,305 ms
244,156 KB
testcase_24 AC 1,293 ms
250,160 KB
testcase_25 AC 1,348 ms
252,648 KB
testcase_26 AC 1,304 ms
250,408 KB
testcase_27 AC 1,373 ms
251,092 KB
testcase_28 AC 1,331 ms
250,592 KB
testcase_29 AC 1,198 ms
197,968 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

public class Main {
    static PrintWriter out;
    static InputReader ir;
    static final int[] dx = { 0, 1, 0, -1 };
    static final int[] dy = { 1, 0, -1, 0 };

    static void solve() {
        int n = ir.nextInt();
        int m = ir.nextInt();
        HashMap<Long, Long> mp = new HashMap<>();
        for (int i = 0; i < m; i++) {
            int h = ir.nextInt() - 1;
            int w = ir.nextInt() - 1;
            long c = ir.nextLong();
            mp.put((long) h << 10 | w, c);
        }
        Graph[] g = new Graph[n * n * 2];
        for (int i = 0; i < n * n * 2; i++)
            g[i] = new Graph();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < 4; k++) {
                    int nx = i + dx[k];
                    int ny = j + dy[k];
                    if (nx < 0 || ny < 0 || nx >= n || ny >= n)
                        continue;
                    long cost = 1;
                    if (mp.containsKey((long) nx << 10 | ny)) {
                        cost += mp.get((long) nx << 10 | ny);
                    }
                    g[i * n + j].add(new long[] { nx * n + ny, cost });
                    g[n * n + i * n + j].add(new long[] { n * n + nx * n + ny, cost });
                    if (cost > 1) {
                        g[i * n + j].add(new long[] { n * n + nx * n + ny, 1 });
                    }
                }
            }
        }
        long[] d = dijkstra(0, g);
        out.println(Math.min(d[n * n - 1], d[n * n * 2 - 1]));
    }

    public static long[] dijkstra(int s, Graph[] g) {
        long[] d = new long[g.length];
        PriorityQueue<long[]> pq = new PriorityQueue<long[]>(new Comparator<long[]>() {
            public int compare(long[] a, long[] b) {
                return Long.compare(a[1], b[1]);
            }
        });
        Arrays.fill(d, 1L << 60);
        d[s] = 0;
        pq.offer(new long[] { s, 0 });
        while (!pq.isEmpty()) {
            long[] p = pq.poll();
            int from = (int) p[0];
            if (d[from] != p[1])
                continue;
            for (int i = 0; i < g[from].size(); i++) {
                long[] e = g[from].get(i);
                int to = (int) e[0];
                if (d[to] > d[from] + e[1]) {
                    d[to] = d[from] + e[1];
                    pq.offer(new long[] { to, d[to] });
                }
            }
        }
        return d;
    }

    static class Graph extends ArrayList<long[]> {
    }

    public static void main(String[] args) {
        ir = new InputReader(System.in);
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }

    static class InputReader {

        private InputStream in;
        private byte[] buffer = new byte[1024];
        private int curbuf;
        private int lenbuf;

        public InputReader(InputStream in) {
            this.in = in;
            this.curbuf = this.lenbuf = 0;
        }

        public boolean hasNextByte() {
            if (curbuf >= lenbuf) {
                curbuf = 0;
                try {
                    lenbuf = in.read(buffer);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (lenbuf <= 0)
                    return false;
            }
            return true;
        }

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

        private boolean isSpaceChar(int c) {
            return !(c >= 33 && c <= 126);
        }

        private void skip() {
            while (hasNextByte() && isSpaceChar(buffer[curbuf]))
                curbuf++;
        }

        public boolean hasNext() {
            skip();
            return hasNextByte();
        }

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

        public int nextInt() {
            if (!hasNext())
                throw new NoSuchElementException();
            int c = readByte();
            while (isSpaceChar(c))
                c = readByte();
            boolean minus = false;
            if (c == '-') {
                minus = true;
                c = readByte();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res = res * 10 + c - '0';
                c = readByte();
            } while (!isSpaceChar(c));
            return (minus) ? -res : res;
        }

        public long nextLong() {
            if (!hasNext())
                throw new NoSuchElementException();
            int c = readByte();
            while (isSpaceChar(c))
                c = readByte();
            boolean minus = false;
            if (c == '-') {
                minus = true;
                c = readByte();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res = res * 10 + c - '0';
                c = readByte();
            } while (!isSpaceChar(c));
            return (minus) ? -res : res;
        }

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

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            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 char[][] nextCharMap(int n, int m) {
            char[][] map = new char[n][m];
            for (int i = 0; i < n; i++)
                map[i] = next().toCharArray();
            return map;
        }
    }

    static void tr(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }
}
0