oj.uz

Submission #386325

# Submission time Handle Problem Language Result Execution time Memory
386325 2021-04-06T11:40:22 Z FatihSolak Calvinball championship (CEOI15_teams) C++17
100 / 100
 225 ms 620 KB 
#include <bits/stdc++.h>
#define N 10005
#define mod 1000007
using namespace std;
long long dp[N];
int arr[N];
int maxi[N];
void solve(){
    int n;
    cin >> n;
    for(int i= 0;i<N;i++)dp[i] = 1;
    long long ans = 1;
    for(int i=1;i<=n;i++){
        cin >> arr[i];
        maxi[i+1] = max(maxi[i],arr[i]);
    }
    for(int i = 0;i<n;i++){ 
        ans = (ans + dp[maxi[n-i]] * (arr[n-i]-1))%mod;
        for(int j=1;j<n;j++){
            dp[j] = (dp[j] * j + dp[j+1]) %mod;
        }
    }
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 492 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 620 KB Output is correct
2 Correct 52 ms 492 KB Output is correct
3 Correct 52 ms 492 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 620 KB Output is correct
2 Correct 206 ms 620 KB Output is correct
3 Correct 202 ms 620 KB Output is correct