oj.uz

Submission #110617

# Submission time Handle Problem Language Result Execution time Memory
110617 2019-05-11T14:03:26 Z someone_aa Calvinball championship (CEOI15_teams) C++17
70 / 100
 38 ms 9976 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 1100;
const ll mod = 1000007;
int dp[maxn][maxn];
int a[maxn], n;

bool important[maxn];


int main() {
    // dp[i][j] -> If we are given a sequence of arbitrary length and maximum element j,
    // on how many ways can we extend it if we can add exactly i elements
    cin>>n;

    for(int i=1;i<=n;i++) {
        dp[0][i] = 1;
    }

    for(int i=1;i<=n;i++) {
        //cout<<i<<": \n";
        for(int j=1;j<=n;j++) {
            dp[i][j] = j*dp[i-1][j] + dp[i-1][j+1];
            dp[i][j] %= mod;
            //cout<<j<<": "<<dp[i][j]<<"\n";
        }
    }

    int result = 0;
    int maxv = 1;
    for(int i=1;i<=n;i++) {
        cin>>a[i];
        result += (a[i]-1)*(dp[n-i][maxv]); result %= mod;
        maxv = max(maxv, a[i]);
    }
    cout<<(result+1)%mod;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4608 KB Output is correct
2 Correct 8 ms 4672 KB Output is correct
3 Correct 8 ms 4608 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 9976 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 9856 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 38 ms 9948 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -