baka

#include <iostream>
using namespace std;
typedef long long ll;
#define M 1000000007
ll t[10101][10101];
int A[10101];
int main(){
    int n;
    cin >> n;
    for(int i=0; i<n; ++i){
        cin >> A[i];
    }
    A[0]=0; A[n-1]=0;
    t[0][0]=1;
    for(int i=1; i<n; ++i){
        int h=A[i-1]+1;
        if(A[i]!=-1){
            int u=A[i];
            t[i][u]= t[i-1][u]+t[i-1][u+1];
            if(u>0) t[i][u]+=t[i-1][u-1];
            t[i][u]%=M;
            continue;
        }
        for(int j=0; j<=h; ++j){
            if(j>0) t[i][j]+= t[i-1][j-1];
            t[i][j]+=t[i-1][j];
            t[i][j]+=t[i-1][j+1];
            t[i][j]%=M;
        }
        A[i]=h;
    }
    cout << t[n-1][0];
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: RUNTIME ERROR