Submission #231754

#	Time	Username	Problem	Language	Result	Execution time	Memory
231754		mehrdad_sohrabi	Calvinball championship (CEOI15_teams)	C++14	100 / 100	703 ms	768 KiB

teams

#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=2e4+100,mod=1000007;
ll a[N];
ll dp[N];
ll ma[N];
int32_t main(){
    sync;
    ll n;
    cin >> n ;
    for (int i=1;i<=n;i++){
        cin >> a[i];
        ma[i]=max(ma[i-1],a[i]);
    }
    for (int i=0;i<N;i++) dp[i]=i+1;
    ll ans=a[n];
    for (int i=n-1;i>1;i--){
        ll z=ma[i-1];
        ans+=dp[z]*(a[i]-1)%mod;
        ans%=mod;
        for (int j=1;j<N;j++){
            dp[j]=j*dp[j]%mod;
            if (j!=N-1) dp[j]+=dp[j+1];
            dp[j]%=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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10