Submission #223823

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,M,Q;
int A[3000],B[3000];
ll mo=1000000007;
ll ret[2001][2001];
ll dp[2001][2001];



void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>Q;
	FOR(i,N) cin>>A[i], B[i]=A[i];
	
	FOR(x,N) {
		A[x]=0;
		ZERO(dp);
		FOR(i,N+1) dp[i][0]=1;
		FOR(i,N) FOR(j,M) {
			if(j-A[i]>=0) dp[i+1][j+1]=(dp[i+1][j]+dp[i][j+1]-dp[i][j-A[i]]+mo) %mo;
			else dp[i+1][j+1]=(dp[i+1][j]+dp[i][j+1]) %mo;
		}
		A[x]=B[x];
		for(i=0;i<=A[x];i++) ret[x][i]=dp[N][M-i];
	}
	
	FOR(i,Q) {
		cin>>x>>y;
		cout << ret[x-1][y] << endl;
		
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}

Submission Info

Judge Result