Submission #963449

#	Time	Username	Problem	Language	Result	Execution time	Memory
963449		penguin133	Calvinball championship (CEOI15_teams)	C++17	10 / 100	1 ms	604 KiB

teams

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, A[10005], dp[105][105][2];

const int mod = 1e6 + 7;
int c(int x, int cur, bool f){
	if(x == n + 1)return 1;
	if(dp[x][cur][f] != -1)return dp[x][cur][f];
	int ans = 0;
	if(f){
		if(cur < A[x])ans += c(x + 1, cur + 1, f & (cur + 1 == A[x]));
		if(cur)ans += c(x + 1, cur, f & (cur == A[x]));
		if(cur)ans += c(x + 1, cur, 0) * (cur - 1);
		ans %= mod;
	}
	else ans += c(x + 1, cur, 0) * cur + c(x + 1, cur + 1, 0), ans %= mod;
	return dp[x][cur][f] = ans;
}
void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++)cin >> A[i];
	memset(dp, -1, sizeof(dp));
	/*
	dp[0][0][1] = 1;
	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= n; j++)dp[i & 1][j] = 0;
		for(int j = 1; j <= A[i]; j++){
			dp[i & 1][j] = dp[(i - 1) & 1][j] * j + dp[(i - 1) & 1][j - 1];
			dp[i & 1][j] %= mod;
		}
	}
	int ans = 0;
	for(int i = 1; i <= n; i++)ans += dp[1 & n][i], ans %= mod;
	cout << ans;
	*/
	cout << c(1, 0, 1);
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

teams.cpp:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main(){
      | ^~~~

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