Submission #527279

#	Time	Username	Problem	Language	Result	Execution time	Memory
527279		Hydroxic_Acid	Calvinball championship (CEOI15_teams)	C++17	50 / 100	4 ms	332 KiB

teams

#include <iostream>
#include <cstring>
using namespace std;

int N;
int arr[10005];
int memo[105][105][2];

int dp(int idx, int num, int marker){
    if(idx >= N) return 0;
    if(idx == N - 1) return 1;
    if(num > N) return 0;
    if(memo[idx][num][marker] != -1) return memo[idx][num][marker];
    int summ = 0;
    for(int i = 1; i <= num + 1; i++){
        if(marker){
            if(i == arr[idx + 1]) summ += dp(idx + 1, max(num, i), 1);
            else if (i < arr[idx + 1]) summ += dp(idx + 1, num, 0);
            else break;
        }
        else if(i == num + 1) summ += dp(idx + 1, num + 1, 0);
        else summ += dp(idx + 1, num, 0);
        summ %= 1000007;
    }
    memo[idx][num][marker] = summ;
    return summ;
}

int main(){
    cin >> N;
    for(int i = 0; i < N; i++) cin >> arr[i];
    memset(memo, -1, sizeof(memo));
    cout << dp(0, 1, 1);
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10