結果
問題 | No.1043 直列大学 |
ユーザー | tenten |
提出日時 | 2023-03-16 11:56:04 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,654 bytes |
コンパイル時間 | 2,918 ms |
コンパイル使用メモリ | 89,848 KB |
実行使用メモリ | 56,236 KB |
最終ジャッジ日時 | 2023-10-18 12:57:33 |
合計ジャッジ時間 | 6,814 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
54,148 KB |
testcase_01 | AC | 86 ms
54,876 KB |
testcase_02 | AC | 88 ms
54,872 KB |
testcase_03 | AC | 80 ms
54,904 KB |
testcase_04 | AC | 88 ms
54,916 KB |
testcase_05 | AC | 75 ms
54,152 KB |
testcase_06 | AC | 88 ms
55,000 KB |
testcase_07 | AC | 86 ms
54,916 KB |
testcase_08 | AC | 80 ms
54,984 KB |
testcase_09 | AC | 80 ms
54,864 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 100 ms
55,420 KB |
testcase_15 | AC | 111 ms
56,232 KB |
testcase_16 | AC | 106 ms
55,872 KB |
testcase_17 | AC | 88 ms
55,052 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 77 ms
54,872 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); long[] volts = new long[100001]; volts[0] = 1; for (int i = 0; i < n; i++) { int x = sc.nextInt(); for (int j = i * 100; j >= 0; j--) { volts[j + x] += volts[j]; volts[j + x] %= MOD; } } long[] resists = new long[100001]; resists[0] = 1; for (int i = 0; i < m; i++) { int x = sc.nextInt(); for (int j = i * 100; j >= 0; j--) { resists[j + x] += resists[j]; resists[j + x] %= MOD; } } int a = sc.nextInt(); int b = sc.nextInt(); for (int i = 1; i <= 100000; i++) { volts[i] += volts[i - 1]; volts[i] %= MOD; } long ans = 0; for (int i = 1; i * a <= 100000; i++) { int max; if (i * (long)b >= 100000) { max = 100000; } else { max = i * b; } ans += (volts[max] - volts[i * a - 1] + MOD) % MOD * resists[i] % MOD; ans %= MOD; } System.out.println(ans); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }