結果

問題 No.1782 ManyCoins
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-15 06:28:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 417 ms / 2,000 ms
コード長 3,485 bytes
コンパイル時間 5,012 ms
コンパイル使用メモリ 88,728 KB
実行使用メモリ 72,324 KB
最終ジャッジ日時 2024-07-23 19:55:08
合計ジャッジ時間 13,537 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 98 ms
52,084 KB
testcase_01 AC 149 ms
53,260 KB
testcase_02 AC 96 ms
51,868 KB
testcase_03 AC 95 ms
51,972 KB
testcase_04 AC 95 ms
51,972 KB
testcase_05 AC 95 ms
51,936 KB
testcase_06 AC 95 ms
52,040 KB
testcase_07 AC 96 ms
52,144 KB
testcase_08 AC 96 ms
51,944 KB
testcase_09 AC 97 ms
51,708 KB
testcase_10 AC 96 ms
52,116 KB
testcase_11 AC 97 ms
51,988 KB
testcase_12 AC 97 ms
52,052 KB
testcase_13 AC 181 ms
57,600 KB
testcase_14 AC 219 ms
57,104 KB
testcase_15 AC 250 ms
57,980 KB
testcase_16 AC 413 ms
60,808 KB
testcase_17 AC 343 ms
61,964 KB
testcase_18 AC 400 ms
60,880 KB
testcase_19 AC 101 ms
52,208 KB
testcase_20 AC 233 ms
57,456 KB
testcase_21 AC 199 ms
56,972 KB
testcase_22 AC 256 ms
59,848 KB
testcase_23 AC 365 ms
62,352 KB
testcase_24 AC 137 ms
70,100 KB
testcase_25 AC 131 ms
52,848 KB
testcase_26 AC 413 ms
60,744 KB
testcase_27 AC 138 ms
53,316 KB
testcase_28 AC 134 ms
69,872 KB
testcase_29 AC 198 ms
70,352 KB
testcase_30 AC 240 ms
71,284 KB
testcase_31 AC 263 ms
71,412 KB
testcase_32 AC 301 ms
72,208 KB
testcase_33 AC 357 ms
72,000 KB
testcase_34 AC 417 ms
72,324 KB
testcase_35 AC 398 ms
71,956 KB
testcase_36 AC 198 ms
55,552 KB
testcase_37 AC 118 ms
54,164 KB
testcase_38 AC 98 ms
51,844 KB
testcase_39 AC 102 ms
52,180 KB
testcase_40 AC 124 ms
54,720 KB
testcase_41 AC 123 ms
54,600 KB
testcase_42 AC 111 ms
54,100 KB
testcase_43 AC 134 ms
65,916 KB
testcase_44 AC 104 ms
51,844 KB
testcase_45 AC 126 ms
54,816 KB
testcase_46 AC 105 ms
51,840 KB
testcase_47 AC 104 ms
52,072 KB
testcase_48 AC 96 ms
51,764 KB
testcase_49 AC 98 ms
52,084 KB
testcase_50 AC 137 ms
69,852 KB
権限があれば一括ダウンロードができます

ソースコード

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).min().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 += (l - dp[i]) / m + 1;
    }
    System.out.println(ret - 1);
  }

  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