Submission

PPPPPTPPPPPPPPPP

Score: 150

User: Nagornz

Problemset: Chocolate

Language: cpp

Time: 1.054 second

Submitted On: 2025-03-15 02:01:17

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,no-stack-protector,inline-small-functions,inline,unsafe-math-optimizations,omit-frame-pointer,inline-functions-called-once")
#include <bits/stdc++.h>
#pragma GCC target("avx2,fma,popcnt,lzcnt,bmi,bmi2,sse4.2,tune=native")
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin();
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin();
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

long long poww(int a, int n){
    long long ans = 1;
    while (n) {
        if (n % 2) ans *= a;
        a *= a;
        n /= 2;
    }
    return ans;
}

int32_t main(){
    iShowSpeed;
    int n, k, c; cin >> n >> k >> c;
    vector <int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i];
    int ll, rr; cin >> ll >> rr;
    vector <vector <int>> dp(2, vector <int> (n + 1));
    vector <vector <int>> pref(n + 1);
    vector <long long> power(1000005);
    int idxx = 1e9;
    for (int i = 0; i <= 1000000; i++) {
        if (!c) power[i] = 1;
        else if (c == 1) power[i] = i;
        else if (c == 2) power[i] = i * i;
        else if (c == 3) power[i] = i * i * i;
        else if (c == 4) power[i] = i * i * i * i;
        else if (c == 5) power[i] = i * i * i * i * i;
        if (power[i] > rr) {
            idxx = i;
            break;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            int num = pref[i].size() ? pref[i].back() : 0;
            if (j - i >= idxx) break;
            long long cal = num + a[j] * power[j - i];
            if (cal > rr) break;
            pref[i].emb(cal);
        }
    }
    // cout << "---------------\n";
    for (int i = 1; i <= n; i++) {
        if (i - 1 >= pref[1].size()) break;
        dp[1][i] = (pref[1][i - 1] >= ll && pref[1][i - 1] <= rr);
        dp[1][i] %= mod;
        // cout << 1 << ", " << i << ": " << dp[1][i] << "\n";
    }
    // cout << "---------------\n";
    for (int i = 2; i <= k; i++) {
        int curr = i % 2, prev = (i - 1) % 2;
        for (int j = 1; j <= n; j++) {
            long long cal = dp[prev][j] + dp[prev][j - 1];
            cal %= mod;
            dp[prev][j] = cal;
        }
        for (int j = 1; j <= n; j++) {
            int l = 1, r = j, lidx = -1, ridx = -1;
            while (l <= r) {
                int mid = (l + r) / 2;
                if (j - mid + 1 > pref[mid].size()) {
                    l = mid + 1;
                    continue;
                }
                if (pref[mid][j - mid] <= rr) r = mid - 1, lidx = mid;
                else l = mid + 1;
            }
            l = 1, r = j;
            while (l <= r) {
                int mid = (l + r) / 2;
                if (j - mid + 1 > pref[mid].size()) {
                    l = mid + 1;
                    continue;
                }
                if (pref[mid][j - mid] >= ll) l = mid + 1, ridx = mid;
                else r = mid - 1;
            }
            if (ridx == -1 || lidx == -1) dp[curr][j] = 0;
            else {
                long long cal = dp[prev][ridx - 1] - (lidx == 1 ? 0 : dp[prev][lidx - 2]);
                cal += mod;
                cal %= mod;
                dp[curr][j] = cal;
            }
        }
        // fill(dp[prev].begin(), dp[prev].end(), 0);
    }
    cout << dp[k % 2][n];
}