結果

問題 No.788 トラックの移動
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-02-08 22:57:56
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,728 bytes
コンパイル時間 2,570 ms
コンパイル使用メモリ 82,760 KB
実行使用メモリ 58,712 KB
最終ジャッジ日時 2024-07-01 11:41:22
合計ジャッジ時間 10,620 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,034 ms
57,356 KB
testcase_01 AC 79 ms
53,316 KB
testcase_02 AC 79 ms
53,316 KB
testcase_03 AC 79 ms
53,308 KB
testcase_04 AC 446 ms
57,108 KB
testcase_05 AC 1,017 ms
57,396 KB
testcase_06 AC 1,073 ms
57,740 KB
testcase_07 AC 80 ms
53,724 KB
testcase_08 AC 80 ms
53,572 KB
testcase_09 AC 79 ms
53,392 KB
testcase_10 AC 80 ms
53,760 KB
testcase_11 AC 83 ms
53,664 KB
testcase_12 AC 83 ms
53,652 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 510 ms
58,712 KB
testcase_16 AC 1,037 ms
57,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;

public class Main {


  private static void solve() {
    int n = ni();
    int m = ni();
    int l = ni() - 1;
    int[] t = na(n);
    int[] from = new int[m];
    int[] to = new int[m];
    int[] w = new int[m];
    for (int i = 0; i < m; i ++) {
      from[i] = ni() - 1;
      to[i] = ni() - 1;
      w[i] = ni();
    }
    int[][][] g = packWU(n, from, to, w);
    
    int[] dl = dijk2(g, l);

    long ret = Long.MAX_VALUE;
    for (int i = 0; i < n; i ++) {
      int[] d = dijk2(g, i);
      long now = 0;
      for (int j = 0; j < n; j ++) {
        now += (long)d[j] * 2 * t[j];
      }
      for (int j = 0; j < n; j ++) {
        if (t[j] > 0) {
          long now2 = now + dl[j] - d[j];
          ret = Math.min(now2, ret);
        }
      }
    }
    System.out.println(ret);
  }
  
  
  public static int[] dijk2(int[][][] g, int from)
  {
      int n = g.length;
      int[] d = new int[n];
      Arrays.fill(d, Integer.MAX_VALUE);
      Queue<int[]> q = new PriorityQueue<int[]>(100000, new Comparator<int[]>(){
          public int compare(int[] a, int[] b) {
              if(a[1] - b[1] != 0)return a[1] - b[1];
              return a[0] - b[0];
          }
      });
      q.add(new int[]{from, 0});
      
      d[from] = 0;
      while(q.size() > 0){
          int[] cur = q.poll();
          for(int[] e : g[cur[0]]){
              int next = e[0];
              int nd = d[cur[0]] + e[1];
              if(nd < d[next]){
                  d[next] = nd;
                  q.add(new int[]{next, nd});
              }
          }
      }
      return d;
  }
  
  public static int[][][] packWU(int n, int[] from, int[] to, int[] w){ return packWU(n, from, to, w, from.length); }
  public static int[][][] packWU(int n, int[] from, int[] to, int[] w, int sup)
  {
      int[][][] g = new int[n][][];
      int[] p = new int[n];
      for(int i = 0;i < sup;i++)p[from[i]]++;
      for(int i = 0;i < sup;i++)p[to[i]]++;
      for(int i = 0;i < n;i++)g[i] = new int[p[i]][2];
      for(int i = 0;i < sup;i++){
          --p[from[i]];
          g[from[i]][p[from[i]]][0] = to[i];
          g[from[i]][p[from[i]]][1] = w[i];
          --p[to[i]];
          g[to[i]][p[to[i]]][0] = from[i];
          g[to[i]][p[to[i]]][1] = w[i];
      }
      return g;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0