Submission #1121792

#TimeUsernameProblemLanguageResultExecution timeMemory
1121792vjudge1Calvinball championship (CEOI15_teams)C++17
30 / 100
1075 ms848 KiB
#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(),v.end()
#define endl '\n'
#define pii pair<ll,ll>
using namespace std;
const ll INF =1e18, mod = 1e6 + 7, N = 1e5 + 5;
ll maxi,q = 1;
ll n;
ll cnt(ll w, ll e){
    if(e > n){
        return 0;
    }
    if(w == 0){
        return 1;
    }
    return(((cnt(w - 1, e) * e ) % mod) + (cnt(w - 1, e + 1) % mod) ) % mod;
}
void solve(){
    cin >> n;
    ll a[n];
    set<ll>s;
    
    for(int i = 1; i <= n; i++){
        cin >> a[i];//1 2 2 
        for(int j = 1; j < a[i]; j++){
            q = (q + cnt(n - i,maxi)) % mod; /// space element      
        }/// 1 , 2      0,2 
        maxi = max(a[i], maxi);
    }
    cout << q % mod<< endl;
}
int main(){
    fast;
    ll t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...