結果

問題 No.1782 ManyCoins
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-15 06:26:54
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,301 ms / 2,000 ms
コード長 3,559 bytes
コンパイル時間 2,871 ms
コンパイル使用メモリ 92,696 KB
実行使用メモリ 78,716 KB
最終ジャッジ日時 2024-07-23 19:54:52
合計ジャッジ時間 20,877 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 92 ms
51,500 KB
testcase_01 AC 145 ms
53,044 KB
testcase_02 AC 97 ms
51,356 KB
testcase_03 AC 95 ms
51,680 KB
testcase_04 AC 94 ms
51,656 KB
testcase_05 AC 96 ms
51,672 KB
testcase_06 AC 96 ms
51,304 KB
testcase_07 AC 94 ms
51,692 KB
testcase_08 AC 94 ms
51,328 KB
testcase_09 AC 93 ms
51,436 KB
testcase_10 AC 95 ms
51,556 KB
testcase_11 AC 93 ms
51,612 KB
testcase_12 AC 94 ms
51,628 KB
testcase_13 AC 173 ms
57,520 KB
testcase_14 AC 566 ms
56,252 KB
testcase_15 AC 450 ms
53,096 KB
testcase_16 AC 775 ms
61,496 KB
testcase_17 AC 857 ms
65,692 KB
testcase_18 AC 429 ms
53,596 KB
testcase_19 AC 100 ms
39,380 KB
testcase_20 AC 242 ms
59,684 KB
testcase_21 AC 1,170 ms
78,716 KB
testcase_22 AC 1,301 ms
78,112 KB
testcase_23 AC 665 ms
73,744 KB
testcase_24 AC 136 ms
56,508 KB
testcase_25 AC 738 ms
73,056 KB
testcase_26 AC 417 ms
51,284 KB
testcase_27 AC 926 ms
75,128 KB
testcase_28 AC 136 ms
56,516 KB
testcase_29 AC 196 ms
60,352 KB
testcase_30 AC 247 ms
62,640 KB
testcase_31 AC 291 ms
61,452 KB
testcase_32 AC 302 ms
61,732 KB
testcase_33 AC 351 ms
61,904 KB
testcase_34 AC 430 ms
61,868 KB
testcase_35 AC 389 ms
61,776 KB
testcase_36 AC 197 ms
43,196 KB
testcase_37 AC 192 ms
58,800 KB
testcase_38 AC 126 ms
46,640 KB
testcase_39 AC 124 ms
42,364 KB
testcase_40 AC 128 ms
55,756 KB
testcase_41 AC 122 ms
49,480 KB
testcase_42 AC 136 ms
53,064 KB
testcase_43 AC 133 ms
52,552 KB
testcase_44 AC 135 ms
51,424 KB
testcase_45 AC 153 ms
54,848 KB
testcase_46 AC 103 ms
38,612 KB
testcase_47 AC 149 ms
46,600 KB
testcase_48 AC 97 ms
38,868 KB
testcase_49 AC 94 ms
38,868 KB
testcase_50 AC 136 ms
56,396 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).max().getAsInt();
    var gen = new Random();
    int m = w[gen.nextInt(n)];
    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