結果

問題 No.2387 Yokan Factory
ユーザー hiromi_ayasehiromi_ayase
提出日時 2023-07-21 22:38:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,207 ms / 5,000 ms
コード長 4,753 bytes
コンパイル時間 2,726 ms
コンパイル使用メモリ 90,584 KB
実行使用メモリ 94,676 KB
最終ジャッジ日時 2023-10-21 22:40:13
合計ジャッジ時間 26,157 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
54,368 KB
testcase_01 AC 68 ms
54,248 KB
testcase_02 AC 67 ms
54,244 KB
testcase_03 AC 70 ms
54,240 KB
testcase_04 AC 68 ms
54,236 KB
testcase_05 AC 70 ms
54,240 KB
testcase_06 AC 67 ms
54,228 KB
testcase_07 AC 68 ms
54,248 KB
testcase_08 AC 69 ms
52,188 KB
testcase_09 AC 70 ms
54,240 KB
testcase_10 AC 68 ms
54,304 KB
testcase_11 AC 69 ms
54,240 KB
testcase_12 AC 69 ms
53,116 KB
testcase_13 AC 69 ms
54,260 KB
testcase_14 AC 68 ms
54,228 KB
testcase_15 AC 1,344 ms
91,316 KB
testcase_16 AC 1,128 ms
83,688 KB
testcase_17 AC 1,920 ms
94,676 KB
testcase_18 AC 1,759 ms
85,300 KB
testcase_19 AC 1,557 ms
78,536 KB
testcase_20 AC 1,279 ms
78,296 KB
testcase_21 AC 2,207 ms
81,908 KB
testcase_22 AC 1,254 ms
73,656 KB
testcase_23 AC 1,711 ms
78,204 KB
testcase_24 AC 1,104 ms
79,140 KB
testcase_25 AC 1,131 ms
72,668 KB
testcase_26 AC 1,897 ms
80,036 KB
testcase_27 AC 1,982 ms
80,512 KB
testcase_28 AC 142 ms
58,816 KB
testcase_29 AC 159 ms
58,880 KB
testcase_30 AC 153 ms
58,852 KB
testcase_31 AC 150 ms
58,848 KB
testcase_32 AC 124 ms
56,540 KB
testcase_33 AC 117 ms
56,072 KB
testcase_34 AC 165 ms
59,328 KB
testcase_35 AC 156 ms
58,776 KB
testcase_36 AC 110 ms
56,280 KB
testcase_37 AC 72 ms
54,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    int m = ni();
    long x = nl();
    int[] from = new int[m];
    int[] to = new int[m];
    int[] a = new int[m];
    int[] b = new int[m];
    for (int i = 0; i < m; i++) {
      from[i] = ni() - 1;
      to[i] = ni() - 1;
      a[i] = ni();
      b[i] = ni();
    }

    int ok = -1;
    int ng = (int)1e9 + 10;
    int[] u = new int[m];
    int[] v = new int[m];
    int[] w = new int[m];

    while (Math.abs(ok - ng) > 1) {
      int cur = (ok + ng) / 2;

      int ptr = 0;
      for (int i = 0; i < m; i++) {
        if (b[i] >= cur) {
          u[ptr] = from[i];
          v[ptr] = to[i];
          w[ptr] = a[i];
          ptr++;
        }
      }
      var g = packWU(n, u, v, w, ptr);
      var d = dijk(g, 0);
      if (d[n - 1] <= x) {
        ok = cur;
      } else {
        ng = cur;
      }
    }
    System.out.println(ok);
  }

  public static long[] dijk(int[][][] g, int from) {
    int n = g.length;
    final long[] td = new long[n];
    Arrays.fill(td, Long.MAX_VALUE);
    TreeSet<Integer> q = new TreeSet<Integer>(new Comparator<Integer>() {
      public int compare(Integer a, Integer b) {
        if (td[a] - td[b] != 0)
          return Long.signum(td[a] - td[b]);
        return a - b;
      }
    });
    q.add(from);
    td[from] = 0;

    while (q.size() > 0) {
      int cur = q.pollFirst();

      for (int i = 0; i < g[cur].length; i++) {
        int next = g[cur][i][0];
        var nd = td[cur] + g[cur][i][1];
        if (nd < td[next]) {
          q.remove(next);
          td[next] = nd;
          q.add(next);
        }
      }
    }

    return td;
  }

  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