結果

問題 No.1043 直列大学
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-05-01 23:10:23
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,420 bytes
コンパイル時間 2,636 ms
コンパイル使用メモリ 91,628 KB
実行使用メモリ 55,436 KB
最終ジャッジ日時 2024-06-07 11:25:33
合計ジャッジ時間 8,531 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
38,540 KB
testcase_01 AC 88 ms
38,432 KB
testcase_02 AC 90 ms
38,528 KB
testcase_03 AC 86 ms
38,464 KB
testcase_04 AC 89 ms
38,272 KB
testcase_05 AC 87 ms
38,108 KB
testcase_06 AC 87 ms
38,480 KB
testcase_07 AC 86 ms
38,472 KB
testcase_08 AC 87 ms
38,560 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 194 ms
41,376 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 202 ms
41,536 KB
testcase_20 WA -
testcase_21 AC 190 ms
41,488 KB
testcase_22 AC 194 ms
41,244 KB
testcase_23 AC 239 ms
41,608 KB
testcase_24 AC 174 ms
41,064 KB
testcase_25 AC 203 ms
41,376 KB
testcase_26 AC 208 ms
41,468 KB
testcase_27 AC 140 ms
40,072 KB
testcase_28 AC 169 ms
41,332 KB
testcase_29 AC 115 ms
40,532 KB
testcase_30 AC 191 ms
41,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {

  private static void solve() {
    int n = ni();
    int m = ni();

    int[] v = na(n);
    int[] r = na(m);
    int a = ni();
    int b = ni();
    int mod = (int) 1e9 + 7;
    int max1 = Arrays.stream(v).sum();
    int max2 = Arrays.stream(r).sum();
    long[] dp1 = new long[max1 + 1];
    long[] dp2 = new long[max2 + 1];

    dp1[0] = 1;
    dp2[0] = 1;
    for (int i = 0; i < n; i++) {
      for (int j = max1; j >= v[i]; j--) {
        dp1[j] += dp1[j - v[i]];
        dp1[j] %= mod;
      }
    }
    for (int i = 0; i < m; i++) {
      for (int j = max2; j >= r[i]; j--) {
        dp2[j] += dp2[j - r[i]];
        dp2[j] %= mod;
      }
    }

    long[] sum = new long[max1 + 2];
    for (int i = 0; i <= max1; i++) {
      sum[i + 1] = sum[i] + dp1[i];
    }

    long ret = 0;
    for (int i = 1; i <= max2; i++) {
      int from = Math.min(max1 + 1, i * a);
      int to = Math.min(max1 + 1, i * b + 1);

      ret += dp2[i] * (sum[to] - sum[from]) % mod;
      ret %= mod;
    }

    System.out.println(ret);
  }


  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