結果
問題 | No.1782 ManyCoins |
ユーザー | hiromi_ayase |
提出日時 | 2021-12-15 06:26:54 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,186 ms / 2,000 ms |
コード長 | 3,559 bytes |
コンパイル時間 | 4,028 ms |
コンパイル使用メモリ | 87,956 KB |
実行使用メモリ | 93,404 KB |
最終ジャッジ日時 | 2023-10-01 02:26:14 |
合計ジャッジ時間 | 19,388 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 88 ms
53,360 KB |
testcase_01 | AC | 131 ms
55,004 KB |
testcase_02 | AC | 86 ms
53,356 KB |
testcase_03 | AC | 86 ms
53,768 KB |
testcase_04 | AC | 86 ms
53,228 KB |
testcase_05 | AC | 86 ms
53,368 KB |
testcase_06 | AC | 86 ms
53,300 KB |
testcase_07 | AC | 86 ms
53,304 KB |
testcase_08 | AC | 87 ms
53,324 KB |
testcase_09 | AC | 87 ms
53,336 KB |
testcase_10 | AC | 87 ms
53,608 KB |
testcase_11 | AC | 87 ms
53,336 KB |
testcase_12 | AC | 88 ms
53,328 KB |
testcase_13 | AC | 173 ms
59,956 KB |
testcase_14 | AC | 1,135 ms
87,636 KB |
testcase_15 | AC | 420 ms
65,384 KB |
testcase_16 | AC | 886 ms
80,904 KB |
testcase_17 | AC | 620 ms
71,316 KB |
testcase_18 | AC | 528 ms
65,680 KB |
testcase_19 | AC | 93 ms
53,304 KB |
testcase_20 | AC | 325 ms
61,368 KB |
testcase_21 | AC | 198 ms
60,308 KB |
testcase_22 | AC | 717 ms
75,216 KB |
testcase_23 | AC | 1,186 ms
93,404 KB |
testcase_24 | AC | 125 ms
72,736 KB |
testcase_25 | AC | 558 ms
70,336 KB |
testcase_26 | AC | 439 ms
61,776 KB |
testcase_27 | AC | 851 ms
81,104 KB |
testcase_28 | AC | 126 ms
72,484 KB |
testcase_29 | AC | 190 ms
72,720 KB |
testcase_30 | AC | 240 ms
73,224 KB |
testcase_31 | AC | 265 ms
72,960 KB |
testcase_32 | AC | 270 ms
72,640 KB |
testcase_33 | AC | 342 ms
73,300 KB |
testcase_34 | AC | 373 ms
73,128 KB |
testcase_35 | AC | 400 ms
73,272 KB |
testcase_36 | AC | 244 ms
60,928 KB |
testcase_37 | AC | 196 ms
70,656 KB |
testcase_38 | AC | 125 ms
61,644 KB |
testcase_39 | AC | 95 ms
53,524 KB |
testcase_40 | AC | 115 ms
57,360 KB |
testcase_41 | AC | 131 ms
64,696 KB |
testcase_42 | AC | 122 ms
61,380 KB |
testcase_43 | AC | 123 ms
68,352 KB |
testcase_44 | AC | 115 ms
56,824 KB |
testcase_45 | AC | 116 ms
57,396 KB |
testcase_46 | AC | 151 ms
55,704 KB |
testcase_47 | AC | 151 ms
55,828 KB |
testcase_48 | AC | 89 ms
53,244 KB |
testcase_49 | AC | 88 ms
53,888 KB |
testcase_50 | AC | 125 ms
72,444 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 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)); } }