-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArray Description.cpp
More file actions
59 lines (45 loc) · 1.13 KB
/
Copy pathArray Description.cpp
File metadata and controls
59 lines (45 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <bits/stdc++.h>
using namespace std;
long long dp[105][100005];
const long long MOD = 1000000007;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
vector<long long> lista(n + 1);
cin >> lista[1];
if(lista[1] == 0){
for(long long i = 1; i <= m; i ++){
dp[i][1] = 1;
}
}
else{
dp[lista[1]][1] = 1;
}
for(long long i = 2; i <= n; i ++){
cin >> lista[i];
if(lista[i] == 0){
for(long long j = 1; j <= m; j ++){
dp[j][i] = dp[j][i - 1] + dp[j - 1][i - 1] + dp[j + 1][i - 1];
dp[j][i] %= MOD;
}
}
else{
dp[lista[i]][i] = dp[lista[i]][i - 1] + dp[lista[i] - 1][i - 1] + dp[lista[i] + 1][i - 1];
dp[lista[i]][i] %= MOD;
}
}
if(lista[n] == 0){
long long sum = 0;
for(long long i = 1; i <= m; i ++){
sum += dp[i][n];
sum %= MOD;
}
cout << sum;
return 0;
}
cout << dp[lista[n]][n];
return 0;
}