Submission #530739

#	Time	Username	Problem	Language	Result	Execution time	Memory
530739		Yazan_Alattar	Calvinball championship (CEOI15_teams)	C++14	70 / 100	121 ms	65540 KiB

teams

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 10007;
const ll inf = 2e9;
const ll mod = 1e6 + 7;
const double pi = acos(-1);
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

ll n, a[M], dp[M][M], pref[M], ans = 1;

ll get(int i, int j){ return (dp[i][j] - dp[i][j - 1] + mod) % mod; }

int main(){
	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> a[i], pref[i] = max(pref[i - 1], a[i]);

	for(int i = 1; i <= n; ++i) dp[n][i] = i;
	for(int i = n - 1; i; --i){
		for(ll j = 1; j <= i; ++j){
			dp[i][j] = dp[i][j - 1];
			dp[i][j] = (dp[i][j] + get(i + 1, j + 1)) % mod;
			dp[i][j] = (dp[i][j] + get(i + 1, j) * j) % mod;
		}
	}
	
	for(int i = 1; i <= n; ++i){
		ll add = get(i, pref[i - 1]) * min(pref[i - 1], a[i] - 1);
		if(a[i] > pref[i - 1]) add = (add + dp[i][a[i] - 1] - dp[i][pref[i - 1]] + mod) % mod;
		ans = (ans + add) % mod;
	}
	
	cout << ans << endl;
	return 0;
}

• 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