Submission #1111169

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111169		Ghulam_Junaid	Calvinball championship (CEOI15_teams)	C++17	70 / 100	16 ms	16720 KiB

teams

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
const ll N = 1e3 + 10;
const ll mod = 1e6 + 7;
ll n, ans, a[N], dp[N][N];
 
ll pwr(ll a, ll b){
	if (b == 0)
		return 1;
 
	ll val = pwr(a, b/2);
	val *= val;
	val %= mod;
 
	if (b&1)
		val *= a;
	val %= mod;
 
	return val;
}
 
int main()
{
	cin >> n;
	for (ll i=1; i<=n; i++){
		cin >> a[i];
	}
	for (ll i=n; i>0; i--){
		for (ll j=1; j<=n; j++){
			if (i==n){
				dp[i][j] = dp[i][j-1] + 1;
				continue;
			}
			dp[i][j] = (j-1) * dp[i+1][j] + dp[i+1][j+1];
			dp[i][j] %= mod;
		}
	}
 
	ll mx = 0;
	for (ll i=1; i<n; i++){
		ans += (a[i] - 1) * dp[i+1][mx+1];
		ans %= mod;
		mx = max(mx, a[i]);
	}
	ans += dp[n][a[n]];
	ans %= mod;
	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