제출 #126057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126057		Mahmoud_Adel	Calvinball championship (CEOI15_teams)	C++14	20 / 100	27 ms	16248 KiB

teams

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const int N = 1e3+5, mod = 1e9+7;
ll n, dp[N][N][2], a[N];
ll sol(int i, ll j, int bit)
{
	if(i == n) return 1;
	ll &ret = dp[i][j][bit];
	if(ret != -1) return ret;
	if(bit) ret = j*sol(i+1, j, 1)%mod + sol(i+1, j+1, 1)%mod;
	else ret = (a[i]-1)*sol(i+1, max(j, a[i]-1), 1)%mod + 
	sol(i+1, max(j, a[i]), 0)%mod;
	return ret%mod;
}
int main()
{
	memset(dp, -1, sizeof dp);
	cin >> n;
	for(int i=0; i<n; i++) cin >> a[i];
	cout << sol(0, 0, 0) << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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