結果

問題 No.1782 ManyCoins
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-15 05:07:22
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,498 bytes
コンパイル時間 4,404 ms
コンパイル使用メモリ 83,808 KB
実行使用メモリ 105,124 KB
最終ジャッジ日時 2023-10-01 02:24:16
合計ジャッジ時間 27,724 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
53,552 KB
testcase_01 AC 136 ms
54,908 KB
testcase_02 AC 92 ms
53,636 KB
testcase_03 AC 91 ms
53,672 KB
testcase_04 AC 92 ms
53,676 KB
testcase_05 WA -
testcase_06 AC 91 ms
53,852 KB
testcase_07 AC 89 ms
54,044 KB
testcase_08 AC 89 ms
53,440 KB
testcase_09 AC 92 ms
53,792 KB
testcase_10 AC 92 ms
53,732 KB
testcase_11 AC 93 ms
53,656 KB
testcase_12 AC 92 ms
53,816 KB
testcase_13 WA -
testcase_14 AC 1,310 ms
99,396 KB
testcase_15 AC 843 ms
80,044 KB
testcase_16 AC 907 ms
84,256 KB
testcase_17 AC 1,391 ms
97,608 KB
testcase_18 AC 1,082 ms
84,120 KB
testcase_19 WA -
testcase_20 AC 1,202 ms
98,896 KB
testcase_21 AC 1,404 ms
105,124 KB
testcase_22 AC 1,572 ms
104,396 KB
testcase_23 AC 1,307 ms
103,328 KB
testcase_24 WA -
testcase_25 AC 1,362 ms
103,780 KB
testcase_26 AC 690 ms
76,292 KB
testcase_27 AC 1,563 ms
104,028 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 293 ms
73,048 KB
testcase_33 AC 330 ms
71,324 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 AC 234 ms
58,636 KB
testcase_48 AC 90 ms
53,636 KB
testcase_49 WA -
testcase_50 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    long l = nl();
    int[] w = na(n);

    int m = Arrays.stream(w).max().getAsInt();
    var dp = dijkstra(w, m);

    long ret = 0;
    for (int i = 0; i < m; i ++) {
      if (dp[i] < 0 || dp[i] > l) continue;

      ret += Math.max(0, (l - dp[i] + m - 1)) / m;
    }
    System.out.println(ret);
  }

  private static long[] dijkstra(int[] a, int m) {
    final long[] d = new long[m];
    Arrays.fill(d, Long.MAX_VALUE / 2);
    d[0] = 0;
    PriorityQueue<long[]> q = new PriorityQueue<>((o1, o2) -> Long.compare(d[(int)o1[0]], d[(int)o2[0]]));

    int n = a.length;
    q.add(new long[] { 0, 0 });
    while (!q.isEmpty()) {
      var p = q.poll();
      int v = (int)p[0];
      var dv = p[1];
      if (dv > d[v])
        continue;

      for (int i = 0; i < n; i++) {
        int nv = (a[i] + v) % m;
        var nd = dv + a[i];
        if (nd < d[nv]) {
          d[nv] = nd;
          q.add(new long[] { nv, nd });
        }
      }
    }
    return Arrays.stream(d).map(v -> v >= Long.MAX_VALUE / 2 ? -1 : v).toArray(); }

  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