제출 #171672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
171672		alishahali1382	Calvinball championship (CEOI15_teams)	C++14	100 / 100	213 ms	764 KiB

teams

#include <bits/stdc++.h>
#if defined(__GNUC__)
#pragma GCC optimize ("Ofast")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000007;
const int MAXN = 10010, LOG=20;

ll n, m, k, u, v, x, y, t, ans;
int A[MAXN], B[MAXN];
ll dp[2][MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++) cin>>A[i], B[i]=max(B[i-1], A[i]);
	
	int a=0, b=1;
	for (int j=0; j<=n; j++) dp[a][j]=1;
	for (int i=0; i<n; i++){
		ans+=dp[a][B[n-i-1]]*(A[n-i]-1);
		for (int j=0; j<=n; j++) dp[b][j]=(dp[a][j]*j + dp[a][j+1])%mod;
		swap(a, b);
	}
	ans++;
	cout<<ans%mod<<'\n';
		
	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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10