oj.uz

답안 #573321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573321 2022-06-06T12:06:56 Z vladislav11 Calvinball championship (CEOI15_teams) C++14
70 / 100
 12 ms 12244 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;
ll dp[10100][10100];

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;

    if ( n > 1000 )
        return 0;

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 4 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12244 KB Output is correct
2 Correct 6 ms 12244 KB Output is correct
3 Correct 12 ms 12236 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 404 KB Output isn't correct
2 Halted 0 ms 0 KB -