結果

問題 No.1043 直列大学
ユーザー OlandOland
提出日時 2020-05-02 08:24:11
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 7,798 bytes
コンパイル時間 2,263 ms
コンパイル使用メモリ 79,748 KB
実行使用メモリ 58,580 KB
最終ジャッジ日時 2024-06-08 02:50:41
合計ジャッジ時間 9,751 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 109 ms
46,176 KB
testcase_01 AC 90 ms
45,188 KB
testcase_02 AC 176 ms
47,148 KB
testcase_03 AC 107 ms
45,792 KB
testcase_04 AC 107 ms
44,900 KB
testcase_05 AC 94 ms
45,152 KB
testcase_06 AC 107 ms
45,100 KB
testcase_07 AC 133 ms
47,008 KB
testcase_08 AC 137 ms
47,104 KB
testcase_09 AC 201 ms
47,304 KB
testcase_10 AC 216 ms
47,120 KB
testcase_11 AC 259 ms
47,328 KB
testcase_12 AC 278 ms
47,080 KB
testcase_13 AC 249 ms
47,268 KB
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 AC 219 ms
47,268 KB
testcase_19 AC 246 ms
47,304 KB
testcase_20 AC 217 ms
47,348 KB
testcase_21 AC 233 ms
47,204 KB
testcase_22 AC 238 ms
47,068 KB
testcase_23 AC 273 ms
47,260 KB
testcase_24 AC 233 ms
47,252 KB
testcase_25 AC 246 ms
47,300 KB
testcase_26 AC 258 ms
47,072 KB
testcase_27 AC 197 ms
47,292 KB
testcase_28 AC 260 ms
47,340 KB
testcase_29 AC 176 ms
47,244 KB
testcase_30 AC 217 ms
47,280 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    final static long INF = Long.MAX_VALUE / 2;
    
    void solve(){
        int MAX = 100000;
        int N = in.nextInt(), M = in.nextInt();
        int[] V = in.nextIntArray1Index(N), R = in.nextIntArray1Index(M);
        int A = in.nextInt(), B = in.nextInt();
        
        long[][] dpV = new long[2][MAX+1];
        dpV[0][0] = 1;
        for(int i = 1; i <= N; i++){
            Arrays.fill(dpV[i&1], 0);
            for(int j = 0; j <= MAX; j++){
                dpV[i&1][j] = (dpV[i&1][j] + dpV[(i-1)&1][j]) % MOD;
                if(j + V[i] <= MAX)
                    dpV[i&1][j+V[i]] = (dpV[i&1][j+V[i]] + dpV[(i-1)&1][j]) % MOD;
            }
        }
        
        long[][] dpR = new long[2][MAX+1];
        dpR[0][0] = 1;
        for(int i = 1; i <= M; i++){
            Arrays.fill(dpR[i&1], 0);
            for(int j = 0; j <= MAX; j++){
                dpR[i&1][j] = (dpR[i&1][j] + dpR[(i-1)&1][j]) % MOD;
                if(j + R[i] <= MAX)
                    dpR[i&1][j+R[i]] = (dpR[i&1][j+R[i]] + dpR[(i-1)&1][j]) % MOD;
            }
        }
        
        long[] sumV = new long[MAX+1];
        for(int i = 1; i <= MAX; i++) sumV[i] = (sumV[i-1] + dpV[N&1][i]) % MOD;
        
        long ans = 0;
        for(int i = 1; i <= MAX; i++){
            int left = i * A, right = (int)Math.min(MAX, (long)i * B);
            if(left > MAX) continue;
            long cnt = ((sumV[right] - sumV[left] + MOD) % MOD + dpV[N&1][left]) % MOD;
            cnt *= dpR[M&1][i];
            cnt %= MOD;
            ans += cnt;
            ans %= MOD;
        }
        out.println(ans);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0