結果

問題 No.1 道のショートカット
ユーザー ゆうきゆうき
提出日時 2022-10-15 20:28:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 189 ms / 5,000 ms
コード長 6,008 bytes
コンパイル時間 3,144 ms
コンパイル使用メモリ 85,744 KB
実行使用メモリ 58,700 KB
最終ジャッジ日時 2024-06-26 20:17:03
合計ジャッジ時間 10,187 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 102 ms
52,720 KB
testcase_01 AC 104 ms
52,720 KB
testcase_02 AC 104 ms
52,980 KB
testcase_03 AC 106 ms
52,960 KB
testcase_04 AC 103 ms
52,544 KB
testcase_05 AC 104 ms
53,052 KB
testcase_06 AC 105 ms
52,908 KB
testcase_07 AC 104 ms
52,568 KB
testcase_08 AC 136 ms
54,004 KB
testcase_09 AC 121 ms
53,024 KB
testcase_10 AC 127 ms
52,776 KB
testcase_11 AC 148 ms
54,120 KB
testcase_12 AC 185 ms
57,380 KB
testcase_13 AC 174 ms
57,136 KB
testcase_14 AC 110 ms
52,812 KB
testcase_15 AC 108 ms
52,612 KB
testcase_16 AC 115 ms
52,856 KB
testcase_17 AC 106 ms
52,568 KB
testcase_18 AC 108 ms
52,544 KB
testcase_19 AC 108 ms
53,012 KB
testcase_20 AC 129 ms
53,328 KB
testcase_21 AC 116 ms
53,364 KB
testcase_22 AC 108 ms
52,624 KB
testcase_23 AC 189 ms
56,384 KB
testcase_24 AC 186 ms
55,040 KB
testcase_25 AC 137 ms
53,956 KB
testcase_26 AC 122 ms
53,388 KB
testcase_27 AC 185 ms
54,224 KB
testcase_28 AC 105 ms
52,820 KB
testcase_29 AC 127 ms
53,284 KB
testcase_30 AC 111 ms
53,160 KB
testcase_31 AC 127 ms
53,272 KB
testcase_32 AC 141 ms
53,980 KB
testcase_33 AC 126 ms
53,284 KB
testcase_34 AC 183 ms
58,700 KB
testcase_35 AC 110 ms
52,920 KB
testcase_36 AC 125 ms
53,316 KB
testcase_37 AC 115 ms
52,388 KB
testcase_38 AC 104 ms
52,892 KB
testcase_39 AC 113 ms
52,872 KB
testcase_40 AC 109 ms
52,928 KB
testcase_41 AC 108 ms
52,556 KB
testcase_42 AC 103 ms
52,952 KB
testcase_43 AC 104 ms
52,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.lang.management.ManagementFactory;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.function.IntFunction;

class Main{
  boolean isDebug = ManagementFactory.getRuntimeMXBean().getInputArguments().toString()
      .contains("-agentlib:jdwp");
  final MyReader in = new MyReader(System.in);
  final MyWriter out = new MyWriter(System.out);

  public static void main(final String[] args){ new Main().exe(); }

  private void exe(){
    input();
    preCalc();
    solve();
    out.flush();
  }

  int N = in.it();
  int C = in.it();
  int V = in.it();
  int[] S = in.idx(V);
  int[] T = in.idx(V);
  int[] Y = in.it(V);
  int[] M = in.it(V);

  private void input(){}

  List<List<Edge>> g;

  private void preCalc(){
    g = new ArrayList<>();

    for (int i = 0;i < N;i++)
      g.add(new LinkedList<>());

    for (int i = 0;i < V;i++)
      g.get(S[i]).add(new Edge(S[i],T[i],Y[i],M[i]));

  }

  void solve(){
    long[][] len = new long[C +1][N];
    for (var l:len)
      Arrays.fill(l,Integer.MAX_VALUE);
    len[0][0] = 0;

    Queue<Integer> que = new PriorityQueue<>(Comparator.comparing(t -> len[t >>20][t %(1 <<20)]));

    que.add(0);

    while (!que.isEmpty()) {
      int cur = que.poll();
      int c = cur >>20;
      int city = cur %(1 <<20);

      for (var e:g.get(city)) {
        if (C < c +e.y)
          continue;

        int nxt = (c +e.y <<20) +e.t;

        if (len[c +e.y][e.t] > len[c][city] +e.m) {
          len[c +e.y][e.t] = len[c][city] +e.m;
          que.add(nxt);
        }
      }
    }

    long ans = Integer.MAX_VALUE;
    for (var l:len)
      ans = Math.min(ans,l[N -1]);

    if (ans == Integer.MAX_VALUE)
      out.println(-1);
    else
      out.println(ans);
  }

  static class Edge{
    int f;
    int t;
    int y;
    int m;

    public Edge(final int f,final int t,final int y,final int m){
      this.f = f;
      this.t = t;
      this.y = y;
      this.m = m;
    }

  }

  /* 定数 */
  final int mod = (int) 1e9 +7;
  final String yes = "Yes";
  final String no = "No";

  /* 入力 */
  static class MyReader{
    byte[] buf = new byte[1 <<16];
    int head = 0;
    int tail = 0;
    InputStream in;

    public MyReader(final InputStream in){ this.in = in; }

    byte read(){
      if (head == tail) {
        try {
          tail = in.read(buf);
        } catch (IOException e) {
          e.printStackTrace();
        }
        head = 0;
      }
      return buf[head++];
    }

    boolean isPrintable(final byte c){ return 32 < c && c < 127; }

    boolean isNum(final byte c){ return 47 < c && c < 58; }

    byte nextPrintable(){
      byte ret = read();
      return isPrintable(ret) ? ret : nextPrintable();
    }

    int it(){ return (int) lg(); }

    int[] it(final int N){
      int[] a = new int[N];
      Arrays.setAll(a,i -> it());
      return a;
    }

    int[][] it(final int H,final int W){ return arr(new int[H][],i -> it(W)); }

    int idx(){ return it() -1; }

    int[] idx(final int N){
      int[] a = new int[N];
      Arrays.setAll(a,i -> idx());
      return a;
    }

    int[][] idx(final int H,final int W){ return arr(new int[H][],i -> idx(W)); }

    long lg(){
      byte i = nextPrintable();
      boolean negative = i == 45;
      long n = negative ? 0 : i -'0';
      while (isPrintable(i = read()))
        n = 10 *n +i -'0';
      return negative ? -n : n;
    }

    long[] lg(final int N){
      long[] a = new long[N];
      Arrays.setAll(a,i -> lg());
      return a;
    }

    long[][] lg(final int H,final int W){ return arr(new long[H][],i -> lg(W)); }

    char[] ch(){ return str().toCharArray(); }

    char[][] ch(final int H){ return arr(new char[H][],i -> ch()); }

    String line(){
      StringBuilder sb = new StringBuilder();

      byte c;
      while (isPrintable(c = read()) || c == ' ')
        sb.append((char) c);
      return sb.toString();
    }

    String str(){
      StringBuilder sb = new StringBuilder();
      sb.append((char) nextPrintable());
      byte c;
      while (isPrintable(c = read()))
        sb.append((char) c);
      return sb.toString();
    }

    String[] str(final int N){ return arr(new String[N],i -> str()); }

    <T> T[] arr(final T[] arr,final IntFunction<T> f){
      Arrays.setAll(arr,f);
      return arr;
    }
  }

  /* 出力 */
  static class MyWriter{
    OutputStream out;

    byte[] buf = new byte[1 <<16];
    byte[] ibuf = new byte[20];

    int tail = 0;

    public MyWriter(final OutputStream out){ this.out = out; }

    void flush(){
      try {
        out.write(buf,0,tail);
        tail = 0;
      } catch (IOException e) {
        e.printStackTrace();
      }
    }

    void write(final byte b){
      buf[tail++] = b;
      if (tail == buf.length)
        flush();
    }

    void write(final byte[] b,final int off,final int len){
      for (int i = off;i < off +len;i++)
        write(b[i]);
    }

    void write(final char c){ write((byte) c); }

    void write(long n){
      if (n < 0) {
        n = -n;
        write('-');
      }

      int i = ibuf.length;
      do {
        ibuf[--i] = (byte) (n %10 +'0');
        n /= 10;
      } while (n > 0);

      write(ibuf,i,ibuf.length -i);
    }

    void println(final long n){
      write(n);
      write('\n');
    }

    public void println(final double d){ println(String.valueOf(d)); }

    void println(final String s){
      byte[] b = s.getBytes();
      for (byte bb:b)
        write(bb);
      write('\n');
    }

    public void println(final char[] s){
      for (char bb:s)
        write(bb);
      write('\n');
    }

    void println(final int[] a){
      for (int i = 0;i < a.length;i++) {
        if (0 < i)
          write(' ');
        write(a[i]);
      }
      write('\n');
    }

  }
}
0