結果
問題 | No.1782 ManyCoins |
ユーザー | hiromi_ayase |
提出日時 | 2021-12-15 05:09:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,599 ms / 2,000 ms |
コード長 | 3,485 bytes |
コンパイル時間 | 2,486 ms |
コンパイル使用メモリ | 81,908 KB |
実行使用メモリ | 105,616 KB |
最終ジャッジ日時 | 2023-10-01 02:24:48 |
合計ジャッジ時間 | 25,692 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 90 ms
54,204 KB |
testcase_01 | AC | 139 ms
55,012 KB |
testcase_02 | AC | 92 ms
53,504 KB |
testcase_03 | AC | 89 ms
53,868 KB |
testcase_04 | AC | 91 ms
53,944 KB |
testcase_05 | AC | 89 ms
54,260 KB |
testcase_06 | AC | 88 ms
54,000 KB |
testcase_07 | AC | 93 ms
53,708 KB |
testcase_08 | AC | 89 ms
54,072 KB |
testcase_09 | AC | 90 ms
53,816 KB |
testcase_10 | AC | 91 ms
53,968 KB |
testcase_11 | AC | 92 ms
53,712 KB |
testcase_12 | AC | 99 ms
53,628 KB |
testcase_13 | AC | 242 ms
73,352 KB |
testcase_14 | AC | 1,367 ms
99,420 KB |
testcase_15 | AC | 861 ms
81,676 KB |
testcase_16 | AC | 931 ms
84,404 KB |
testcase_17 | AC | 1,381 ms
98,024 KB |
testcase_18 | AC | 1,051 ms
84,324 KB |
testcase_19 | AC | 97 ms
53,792 KB |
testcase_20 | AC | 1,202 ms
98,936 KB |
testcase_21 | AC | 1,435 ms
105,616 KB |
testcase_22 | AC | 1,538 ms
104,600 KB |
testcase_23 | AC | 1,423 ms
103,024 KB |
testcase_24 | AC | 133 ms
72,720 KB |
testcase_25 | AC | 1,438 ms
103,944 KB |
testcase_26 | AC | 729 ms
76,004 KB |
testcase_27 | AC | 1,599 ms
104,292 KB |
testcase_28 | AC | 130 ms
72,592 KB |
testcase_29 | AC | 188 ms
73,144 KB |
testcase_30 | AC | 291 ms
74,360 KB |
testcase_31 | AC | 293 ms
73,068 KB |
testcase_32 | AC | 293 ms
73,244 KB |
testcase_33 | AC | 323 ms
73,028 KB |
testcase_34 | AC | 390 ms
72,828 KB |
testcase_35 | AC | 414 ms
73,624 KB |
testcase_36 | AC | 271 ms
72,820 KB |
testcase_37 | AC | 252 ms
72,900 KB |
testcase_38 | AC | 142 ms
72,420 KB |
testcase_39 | AC | 127 ms
59,476 KB |
testcase_40 | AC | 136 ms
72,388 KB |
testcase_41 | AC | 132 ms
70,272 KB |
testcase_42 | AC | 136 ms
72,800 KB |
testcase_43 | AC | 128 ms
66,396 KB |
testcase_44 | AC | 137 ms
72,352 KB |
testcase_45 | AC | 143 ms
70,532 KB |
testcase_46 | AC | 225 ms
58,768 KB |
testcase_47 | AC | 234 ms
58,856 KB |
testcase_48 | AC | 92 ms
53,788 KB |
testcase_49 | AC | 90 ms
54,052 KB |
testcase_50 | AC | 131 ms
72,464 KB |
ソースコード
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 += (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)); } }