結果
問題 | No.1043 直列大学 |
ユーザー | uwi |
提出日時 | 2020-05-01 21:32:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 3,697 bytes |
コンパイル時間 | 3,560 ms |
コンパイル使用メモリ | 87,028 KB |
実行使用メモリ | 54,056 KB |
最終ジャッジ日時 | 2023-08-24 05:39:40 |
合計ジャッジ時間 | 10,538 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
53,408 KB |
testcase_01 | AC | 69 ms
53,252 KB |
testcase_02 | AC | 85 ms
53,260 KB |
testcase_03 | AC | 78 ms
53,964 KB |
testcase_04 | AC | 69 ms
53,340 KB |
testcase_05 | AC | 69 ms
53,508 KB |
testcase_06 | AC | 62 ms
53,440 KB |
testcase_07 | AC | 79 ms
53,956 KB |
testcase_08 | AC | 80 ms
54,056 KB |
testcase_09 | AC | 190 ms
53,216 KB |
testcase_10 | AC | 202 ms
53,252 KB |
testcase_11 | AC | 265 ms
53,416 KB |
testcase_12 | AC | 283 ms
51,212 KB |
testcase_13 | AC | 247 ms
53,160 KB |
testcase_14 | AC | 258 ms
53,132 KB |
testcase_15 | AC | 276 ms
53,124 KB |
testcase_16 | AC | 255 ms
53,836 KB |
testcase_17 | AC | 204 ms
53,124 KB |
testcase_18 | AC | 211 ms
53,020 KB |
testcase_19 | AC | 243 ms
53,264 KB |
testcase_20 | AC | 201 ms
53,132 KB |
testcase_21 | AC | 236 ms
52,964 KB |
testcase_22 | AC | 242 ms
53,168 KB |
testcase_23 | AC | 280 ms
53,232 KB |
testcase_24 | AC | 223 ms
53,396 KB |
testcase_25 | AC | 251 ms
53,120 KB |
testcase_26 | AC | 261 ms
53,136 KB |
testcase_27 | AC | 166 ms
53,348 KB |
testcase_28 | AC | 250 ms
53,400 KB |
testcase_29 | AC | 132 ms
53,128 KB |
testcase_30 | AC | 205 ms
53,112 KB |
ソースコード
package contest200501; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int[] v = na(n); long[] dv = go(v); int[] w = na(m); long[] dw = go(w); long[] cum = new long[100002]; for(int i = 1;i <= 100000;i++) { cum[i] = cum[i-1] + dv[i]; cum[i] %= mod; } long A = ni(), B = ni(); long ans = 0; for(int i = 1;i <= 100000;i++) { long L = A*i, R = Math.min(100000, B*i); if(L <= R) { ans += dw[i] * (cum[(int)R] - cum[(int)L-1] + mod); ans %= mod; } } out.println(ans); } int mod = 1000000007; long[] go(int[] v) { long[] dp = new long[100001]; dp[0] = 1; for(int u : v) { for(int i = 100000-u;i >= 0;i--) { dp[i+u] += dp[i]; dp[i+u] %= mod; } } return dp; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }