Submission #587971

#	Time	Username	Problem	Language	Result	Execution time	Memory
587971		Blagojce	Calvinball championship (CEOI15_teams)	C++11	70 / 100	201 ms	480 KiB

teams

#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int mxn = 10004;
const ll  mod =  1000007;

int a[mxn];
int n;
	/*

ll dp[mxn][mxn];
ll C(int N, int K){
	if(N == 0) return 1;
	if(dp[N][K] == -1){
		dp[N][K] = C(N-1, K+1) + C(N-1, K)*K;
		dp[N][K] %= mod;
	}
	return dp[N][K];
}*/
int DP1[mxn];
int DP2[mxn];


int main(){
	
	cin >> n;
	fr(i, 0, n){
		cin >> a[i];
	}
	int mx[n];
	
	int c = 0;
	fr(i, 0, n){
		c = max(c, a[i]);
		mx[i] = c;
	}
	ll ans = 1;
	
	fr(i, 0, n+1) DP1[i] = 1;
	
	
	for(int i = n-1; i >= 0; i --){
		int nxt = 1;
		if(i > 0) nxt = mx[i-1];
		
		ans += ((a[i]-1) * DP1[nxt]) % mod;
		ans %= mod;
		
		fr(j, 0, n+1){
			DP2[j] = (DP1[j+1] + j*DP1[j]) % mod;
		}
		fr(j, 0, n+1){
			DP1[j] = DP2[j];
		}
	}
	
	
	/*int nxt = 2;
	ll ans = 1;
	fr(i, 0, n){
		int rem = n-i;
	
		ans += ((a[i]-1) * C(rem-1, nxt-1)) % mod;
		ans %= mod;
		if(a[i] == nxt){
			nxt++;
		}
	}*/
	cout<<ans<<endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10