Submission #1675429

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int a[2010];
int dp[2010][2010], dp2[2010][2010];

signed main() {
    int N, M, Q; cin >> N >> M >> Q;
    rep(i,0,N) cin >> a[i];

    dp[0][0] = 1;
    rep(i,0,N) repq(j,0,M) {
        dp[i+1][j] = dp[i][j];
        if(j-1 >= 0)      (dp[i+1][j] += dp[i+1][j-1]         ) %= MOD;
        if(j-a[i]-1 >= 0) (dp[i+1][j] -= dp[i][j-a[i]-1] - MOD) %= MOD;
    }

    rep(i,0,N) repq(j,0,M) {
        dp2[i][j] = dp[N][j];
        if(j-1 >= 0)      (dp2[i][j] -= dp[N][j-1] - MOD) %= MOD;
        if(j-a[i]-1 >= 0) (dp2[i][j] += dp2[i][j-a[i]-1]) %= MOD;
    }

    rep(i,0,Q) {
        int k, x; cin >> k >> x;
        cout << dp2[k-1][M-x] << endl;
    }
    return 0;
}

Submission Info

Judge Result