oj.uz

Submission #386318

# Submission time Handle Problem Language Result Execution time Memory
386318 2021-04-06T11:16:00 Z FatihSolak Calvinball championship (CEOI15_teams) C++17
70 / 100
 20 ms 16492 KB 
#include <bits/stdc++.h>
#define N 1005
#define mod 1000007
using namespace std;
long long dp[N][N];
int arr[N];
void solve(){
    int n;
    cin >> n;
    for(int i= 0;i<N;i++)dp[0][i] = 1;
    for(int i=1;i<N;i++){
        for(int j=1;j<N;j++){
            dp[i][j] = (dp[i-1][j] * j) % mod;
            if(j != N-1){
                dp[i][j] = (dp[i][j] + dp[i-1][j+1]) % mod;
            }
        }
    }
    int maxi = 0;
    long long ans = 1;
    for(int i=1;i<=n;i++){
        cin >> arr[i];
        if(arr[i] != 1){
            ans = (ans + dp[n-i][maxi] * (arr[i]-1))%mod;
        }
        maxi = max(maxi,arr[i]);
    }
    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 9 ms 8300 KB Output is correct
2 Correct 10 ms 8208 KB Output is correct
3 Correct 10 ms 8300 KB Output is correct
4 Correct 10 ms 8300 KB Output is correct
5 Correct 9 ms 8300 KB Output is correct
6 Correct 9 ms 8300 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 16492 KB Execution killed with signal 11

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 16492 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 16492 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -