제출 #527181

#제출 시각아이디문제언어결과실행 시간메모리
527181Hydroxic_AcidCalvinball championship (CEOI15_teams)C++17
0 / 100
1091 ms844 KiB
#include <iostream>
using namespace std;
 
int N;
int arr[10005];
int memo[10005][10005];
 
int dp(int idx, int num){
    if(idx >= N) return 0;
    if(idx == N - 1) return 1;
    if(num > N) return 0;
    int summ = 0;
    for(int i = 1; i <= min(arr[idx + 1], num + 1); i++){
        if(i == num + 1) summ += dp(idx + 1, num + 1);
        else summ += dp(idx + 1, num);
        summ %= 1000007;
    }
    return summ;
}
 
int main(){
    cin >> N;
    for(int i = 0; i < N; i++) cin >> arr[i];
    cout << dp(0, 1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...