結果

問題 No.1601 With Animals into Institute
ユーザー tentententen
提出日時 2021-07-12 17:12:48
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,785 bytes
コンパイル時間 3,618 ms
コンパイル使用メモリ 77,072 KB
実行使用メモリ 160,320 KB
最終ジャッジ日時 2023-09-14 20:41:10
合計ジャッジ時間 37,755 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 46 ms
49,668 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 2,449 ms
148,672 KB
testcase_11 AC 2,182 ms
148,660 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 2,425 ms
152,936 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 45 ms
49,684 KB
testcase_28 AC 46 ms
49,348 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 47 ms
47,268 KB
testcase_38 AC 47 ms
49,604 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        ArrayList<HashMap<Integer, Integer>> withGraph = new ArrayList<>();
        ArrayList<HashMap<Integer, Integer>> withoutGraph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            withGraph.add(new HashMap<>());
            withoutGraph.add(new HashMap<>());
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int c = sc.nextInt();
            int x = sc.nextInt();
            if (x == 0) {
                withoutGraph.get(a).put(b, c);
                withoutGraph.get(b).put(a, c);
            } else {
                withGraph.get(a).put(b, c);
                withGraph.get(b).put(a, c);
            }
        }
        PriorityQueue<Path> queue = new PriorityQueue<>();
        queue.add(new Path(n - 1, 0, 0));
        long[][] costs = new long[2][n];
        Arrays.fill(costs[0], Long.MAX_VALUE);
        Arrays.fill(costs[1], Long.MAX_VALUE);
        while (queue.size() > 0) {
            Path p = queue.poll();
            if (costs[p.type][p.idx] <= p.value) {
                continue;
            }
            costs[p.type][p.idx] = p.value;
            for (int x : withGraph.get(p.idx).keySet()) {
                queue.add(new Path(x, 1, p.value + withGraph.get(p.idx).get(x)));
            }
            for (int x : withoutGraph.get(p.idx).keySet()) {
                queue.add(new Path(x, p.type, p.value + withoutGraph.get(p.idx).get(x)));
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n - 1; i++) {
            sb.append(costs[1][i]).append("\n");
        }
        System.out.print(sb);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int type;
        long value;
        
        public Path(int idx, int type, long value) {
            this.idx = idx;
            this.type = type;
            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 Combination {
    static final int MOD = 1000000007;
    long[] fac;
    long[] finv;
    long[] inv;
    
    public Combination (int size) {
        fac = new long [size];
        finv = new long [size];
        inv = new long [size];
        fac[0] = 1;
        fac[1] = 1;
        finv[0] = 1;
        finv[1] = 1;
        inv[1] = 1;
        for (int i = 2; i < size; i++) {
            fac[i] = fac[i - 1] * i % MOD;
            inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
            finv[i] = finv[i - 1] * inv[i] % MOD;
        }
    }
    
    
    public long getComb(int n, int k) {
        if (n < k || n < 0 || k < 0) {
            return 0;
        }
        return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
    }
    
}


class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}
0