oj.uz

Submission #98397

# Submission time Handle Problem Language Result Execution time Memory
98397 2019-02-22T20:15:00 Z someone_aa Calvinball championship (CEOI15_teams) C++17
20 / 100
 87 ms 440 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 110;
const ll mod = 1000007;
int dp[maxn][maxn];
int n, arr[maxn];
bool f[maxn];

int count_pref(int st, int maxv, int limit) {
    memset(dp, 0, sizeof(dp));
    dp[st][maxv] = 1;

    if(maxv > limit) return 0;


    for(int i=st+1;i<=n;i++) {
        for(int j=maxv;j<=limit;j++) {
            dp[i][j] = (j * dp[i-1][j])%mod + dp[i-1][j-1];
            dp[i][j] %= mod;
        }
    }

    ll result = 0LL;
    for(int i=1;i<=limit;i++) {
        result += dp[n][i];
        result %= mod;
    }

    return result;

}

int main() {
    cin>>n;
    int maxv = 0;
    for(int i=1;i<=n;i++) {
        cin>>arr[i];

        if(arr[i] > maxv) {
            maxv = arr[i];
            f[i] = true;
        }
    }


    int value = 1;
    ll result = 0LL;
    for(int i=2;i<=n;i++) {
        for(int j=1;j<arr[i];j++) {
            value = max(value, j);
            result += count_pref(i, value, maxv);
            result %= mod;
        }
        value = max(value, arr[i]);
    }

    cout<<(result+1)%mod<<"\n";
    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 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 128 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 428 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -