oj.uz

Submission #573302

# Submission time Handle Problem Language Result Execution time Memory
573302 2022-06-06T11:37:24 Z vladislav11 Calvinball championship (CEOI15_teams) C++14
70 / 100
 36 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const ll MOD = 1e6 + 7;

int n;
vector<int> a;
vector< vector<ll> > dp;

int main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;

    a.resize( n );

    for ( auto& el : a )
        cin >> el;

    dp.assign( n+1, vector<ll>( n+1, 0 ) );

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

    for ( int i=1; i<=n; i++ )
    for ( int j=1; j<=n; j++ )
    {
        if ( j+1 <= n )
            dp[i][j] = ( j*dp[i-1][j] + dp[i-1][j+1] ) % MOD;
        else
            dp[i][j] = j*dp[i-1][j] % MOD;
    }

    ll ans = 1;

    int maxi = 0;

    for ( int i=0; i<n; i++ )
    {
        for ( int j=1; j<a[i]; j++ )
            ans = ( ans + dp[n-i-1][ max(maxi,j) ] ) % MOD;

        maxi = max( maxi, a[i] );
    }

    cout << ans;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -