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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
#define MOD 10000
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dp[105][5][5], d[105];
bool used[105];
int main() {
int n, k;
cin >> n >> k;
memset(used, 0, sizeof(used));
memset(d, 0, sizeof(d));
rep(i, k) {
int a, b;
cin >> a >> b;
used[a] = true;
d[a] = b;
}
memset(dp, 0, sizeof(dp));
if(used[1]) {
REP(j, 1, 4) {
if(d[1] == j) dp[1][j][0] = 1;
}
} else {
REP(j, 1, 4) {
dp[1][j][0] = 1;
}
}
REP(i, 2, n + 1) {
if(used[i]) {
if(d[i] == 1) {
dp[i][1][1] = dp[i-1][1][0];
dp[i][1][0] = (dp[i-1][2][0] + dp[i-1][2][1]) + (dp[i-1][3][0] + dp[i-1][3][1]);
dp[i][1][1] %= MOD;
dp[i][1][0] %= MOD;
} else if(d[i] == 2) {
dp[i][2][1] = dp[i-1][2][0];
dp[i][2][0] = (dp[i-1][1][0] + dp[i-1][1][1]) + (dp[i-1][3][0] + dp[i-1][3][1]);
dp[i][2][1] %= MOD;
dp[i][2][0] %= MOD;
} else {
dp[i][3][1] = dp[i-1][3][0];
dp[i][3][0] = (dp[i-1][1][0] + dp[i-1][1][1]) + (dp[i-1][2][0] + dp[i-1][2][1]);
dp[i][3][1] %= MOD;
dp[i][3][0] %= MOD;
}
} else {
dp[i][1][1] = dp[i-1][1][0];
dp[i][1][0] = (dp[i-1][2][0] + dp[i-1][2][1]) + (dp[i-1][3][0] + dp[i-1][3][1]);
dp[i][2][1] = dp[i-1][2][0];
dp[i][2][0] = (dp[i-1][1][0] + dp[i-1][1][1]) + (dp[i-1][3][0] + dp[i-1][3][1]);
dp[i][3][1] = dp[i-1][3][0];
dp[i][3][0] = (dp[i-1][1][0] + dp[i-1][1][1]) + (dp[i-1][2][0] + dp[i-1][2][1]);
dp[i][1][1] %= MOD;
dp[i][1][0] %= MOD;
dp[i][2][1] %= MOD;
dp[i][2][0] %= MOD;
dp[i][3][1] %= MOD;
dp[i][3][0] %= MOD;
}
}
// rep(i, n + 1) {
// REP(j, 1, 4) {
// cout << "(" << dp[i][j][0] << "," << dp[i][j][1] << ") ";
// }
// cout << endl;
// }
int sum = 0;
REP(j, 1, 4) {
rep(k, 2) {
sum += dp[n][j][k];
sum %= MOD;
}
}
cout << sum << endl;
return 0;
}
|
