oj.uz

Submission #231754

# Submission time Handle Problem Language Result Execution time Memory
231754 2020-05-14T15:25:46 Z mehrdad_sohrabi Calvinball championship (CEOI15_teams) C++14
100 / 100
 703 ms 768 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 640 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 512 KB Output is correct
2 Correct 12 ms 512 KB Output is correct
3 Correct 11 ms 512 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 512 KB Output is correct
2 Correct 39 ms 512 KB Output is correct
3 Correct 39 ms 512 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 636 KB Output is correct
2 Correct 74 ms 632 KB Output is correct
3 Correct 76 ms 668 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 704 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 640 KB Output is correct
2 Correct 346 ms 648 KB Output is correct
3 Correct 354 ms 640 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 683 ms 640 KB Output is correct
2 Correct 696 ms 768 KB Output is correct
3 Correct 687 ms 760 KB Output is correct