結果

問題 No.1043 直列大学
ユーザー ミドリムシミドリムシ
提出日時 2020-05-01 21:45:47
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 4,513 bytes
コンパイル時間 1,448 ms
コンパイル使用メモリ 167,408 KB
実行使用メモリ 161,956 KB
最終ジャッジ日時 2023-08-24 05:40:55
合計ジャッジ時間 3,899 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
12,240 KB
testcase_01 AC 5 ms
9,696 KB
testcase_02 AC 8 ms
16,476 KB
testcase_03 AC 5 ms
9,920 KB
testcase_04 AC 5 ms
9,852 KB
testcase_05 AC 5 ms
10,020 KB
testcase_06 AC 5 ms
9,696 KB
testcase_07 AC 7 ms
14,424 KB
testcase_08 AC 7 ms
14,284 KB
testcase_09 AC 41 ms
86,036 KB
testcase_10 AC 48 ms
102,492 KB
testcase_11 AC 72 ms
150,428 KB
testcase_12 AC 75 ms
161,956 KB
testcase_13 AC 64 ms
139,256 KB
testcase_14 AC 67 ms
145,368 KB
testcase_15 AC 73 ms
159,676 KB
testcase_16 AC 66 ms
143,352 KB
testcase_17 AC 50 ms
106,484 KB
testcase_18 AC 50 ms
106,448 KB
testcase_19 AC 62 ms
135,392 KB
testcase_20 AC 48 ms
104,416 KB
testcase_21 AC 58 ms
125,016 KB
testcase_22 AC 61 ms
131,168 KB
testcase_23 AC 75 ms
161,772 KB
testcase_24 AC 54 ms
116,772 KB
testcase_25 AC 65 ms
137,316 KB
testcase_26 AC 68 ms
147,408 KB
testcase_27 AC 34 ms
73,952 KB
testcase_28 AC 62 ms
135,148 KB
testcase_29 AC 22 ms
47,196 KB
testcase_30 AC 49 ms
104,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, l, r) for(int i = int(l); i < (r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void YES(bool condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
inline void assert_NO(bool condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
inline void assert_No(bool condition){ if(!condition){ cout << "No" << endl; exit(0); } }
inline void assert_minus_1(bool condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int at(lint i, int j){ return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }

lint dp_V[101][100001];
lint dp_R[101][100001];

int main(){
    int N, M;
    cin >> N >> M;
    int V[N], R[M];
    cins(V, V + N);
    cins(R, R + M);
    rep(i, 100001){
        dp_V[N][i] = 0;
        dp_R[M][i] = 0;
    }
    dp_V[N][0] = 1;
    dp_R[M][0] = 1;
    repr(i, N){
        rep(j, 100001){
            dp_V[i][j] = dp_V[i + 1][j];
            if(j >= V[i]){
                dp_V[i][j] += dp_V[i + 1][j - V[i]];
            }
            dp_V[i][j] %= mod;
        }
    }
    repr(i, M){
        rep(j, 100001){
            dp_R[i][j] = dp_R[i + 1][j];
            if(j >= R[i]){
                dp_R[i][j] += dp_R[i + 1][j - R[i]];
            }
            dp_R[i][j] %= mod;
        }
    }
    /*array_output(dp_V[0], dp_V[0] + 20);
    array_output(dp_R[0], dp_R[0] + 20);
    */lint sum[100002];
    sum[0] = 0;
    rep(i, 100001){
        sum[i + 1] = (sum[i] + dp_V[0][i]) % mod;
    }
    lint A, B;
    cin >> A >> B;
    lint ans = 0;
    rep2(i, 1, 100001){
        lint l = min(100001ll, i * A), r = min(100001ll, i * B + 1);
        ans += dp_R[0][i] * (sum[r] - sum[l] + mod) % mod;
    }
    cout << ans % mod << endl;
}
0