oj.uz

답안 #110615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110615 2019-05-11T13:03:27 Z someone_aa Calvinball championship (CEOI15_teams) C++17
20 / 100
 39 ms 9952 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() {
    cin>>n;

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

        if(a[i] > maxv) {
            maxv = a[i];
            important[i] = true;
        }
    }

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

    int j = maxv;
    int result = 0;

    for(int i=0;i<maxv;i++) {
        result += dp[n][i];
        result %= mod;
    }

    for(int i=n;i>=1;i--) {
        if(important[i]) {
            // don't add anything, go to state (i-1, a[i]-1)
            j = a[i] - 1;
        }
        else {
            // add extra, go to state (i-1, j)
            result += dp[i-1][j-1]; result %= mod;
            result += (a[i]-1)*(dp[i-1][j]); result %= mod;
        }
    }

    result++;
    result%=mod;
    cout<<result;
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 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

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1536 KB Output isn't correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 15 ms 612 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 39 ms 9952 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -