Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

// 文字列を1行取得
func StrStdin() (stringReturned string) {
//	scanner := bufio.NewScanner(os.Stdin)

	scanner.Scan()
	stringInput := scanner.Text()

	stringReturned = strings.TrimSpace(stringInput)
	return
}

// 整数値1つ取得
func IntStdin() (int, error) {
	stringInput := StrStdin()
	return strconv.Atoi(strings.TrimSpace(stringInput))
}

// 空白や空文字だけの値を除去したSplit()
func SplitWithoutEmpty(stringTargeted string, delim string) (stringReturned []string) {
	stringSplited := strings.Split(stringTargeted, delim)

	for _, str := range stringSplited {
		if str != "" {
			stringReturned = append(stringReturned, str)
		}
	}

	return
}

// デリミタで分割して文字列スライスを取得
func SplitStrStdin(delim string) (stringReturned []string) {
	// 文字列で1行取得
	stringInput := StrStdin()

	// 空白で分割
	// stringSplited := strings.Split(stringInput, delim)
	stringReturned = SplitWithoutEmpty(stringInput, delim)

	return
}

// デリミタで分割して整数値スライスを取得
func SplitIntStdin(delim string) (intSlices []int, err error) {
	// 文字列スライスを取得
	stringSplited := SplitStrStdin(" ")

	// 整数スライスに保存
	for i := range stringSplited {
		var iparam int
		iparam, err = strconv.Atoi(stringSplited[i])
		if err != nil {
			return
		}
		intSlices = append(intSlices, iparam)
	}
	return
}

func main() {
	nk, _ := SplitIntStdin(" ")
	n, k := nk[0], nk[1]
	kind := make([]int, n)
	for i := 0; i < k; i++ {
		var tmp []int
		var err error
		if tmp, err = SplitIntStdin(" "); err != nil {
			panic(err)
		}
		kind[tmp[0]-1] = tmp[1]
	}
	dp := make([][3][3]int, n)
	if kind[0] > 0 {
		dp[0][0][kind[0]-1] = 1
	} else {
		for i := 0; i < 3; i++ {
			dp[0][0][i] = 1
		}
	}
	if kind[1] > 0 {
		for i := 0; i < 3; i++ {
			dp[1][i][kind[1]-1] = dp[0][0][i]
		}
	} else {
		for i := 0; i < 3; i++ {
			for j := 0; j < 3; j++ {
				dp[1][i][j] = dp[0][0][i]
			}
		}
	}
	for i := 1; i < n-1; i++ {
		if kind[i+1] > 0 {
			for j := 0; j < 3; j++ {
				if j == kind[i+1]-1 {
					for k := 0; k < 3; k++ {
						if j != k {
							dp[i+1][j][kind[i+1]-1] += dp[i][k][j]
							dp[i+1][j][kind[i+1]-1] %= 10000
						}
					}
				} else {
					for k := 0; k < 3; k++ {
						dp[i+1][j][kind[i+1]-1] += dp[i][k][j]
						dp[i+1][j][kind[i+1]-1] %= 10000
					}
				}
			}
		} else {
			for j := 0; j < 3; j++ {
				for k := 0; k < 3; k++ {
					for l := 0; l < 3; l++ {
						if j != k || k != l {
							dp[i+1][k][j] += dp[i][l][k]
							dp[i+1][k][j] %= 10000
						}
					}
				}
			}
		}
	}
	result := 0
	for i := 0; i < 3; i++ {
		for j := 0; j < 3; j++ {
			result += dp[n-1][i][j]
		}
	}
	// fmt.Println(dp)
	// fmt.Println(kind)
	fmt.Println(result % 10000)
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <map>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define MAX_N 105
int vx [4]= {1,0,-1,0};
int vy [4]= {0,1,0,-1};
long long  dp[MAX_N][4][4];//dp[date][today][yesterday]
int V[MAX_N],W[MAX_N];
int data[MAX_N],B[MAX_N];
int K ,N;
using namespace std;
void init(){
    REP(i,4)REP(j,4)dp[2][i][j]=1;
    REP(j,K){
      if(data[j]==1)
        switch (B[j]) {
          case 1 : FOR(l,1,4){dp[2][l][2]=0;dp[2][l][3]=0;}break;
          case 2 : FOR(l,1,4){dp[2][l][1]=0;dp[2][l][3]=0;}break;
          case 3 : FOR(l,1,4){dp[2][l][1]=0;dp[2][l][2]=0;}break;
        }
        else if (data[j]==2)
        switch (B[j]) {
          case 1 : FOR(l,1,4){dp[2][2][l]=0;dp[2][3][l]=0;}break;
          case 2 : FOR(l,1,4){dp[2][1][l]=0;dp[2][3][l]=0;}break;
          case 3 : FOR(l,1,4){dp[2][1][l]=0;dp[2][2][l]=0;}break;
        }

      }
  for(int i=3;i<=N;i++){
    dp[i][1][1]= dp[i-1][1][2]+dp[i-1][1][3];
    dp[i][2][2]= dp[i-1][2][1]+dp[i-1][2][3];
    dp[i][3][3]= dp[i-1][3][2]+dp[i-1][3][1];
    dp[i][1][2]= dp[i-1][2][1]+dp[i-1][2][2]+dp[i-1][2][3];
    dp[i][1][3]= dp[i-1][3][1]+dp[i-1][3][2]+dp[i-1][3][3];
    dp[i][2][1]= dp[i-1][1][1]+dp[i-1][1][2]+dp[i-1][1][3];
    dp[i][2][3]= dp[i-1][3][1]+dp[i-1][3][2]+dp[i-1][3][3];
    dp[i][3][1]= dp[i-1][1][1]+dp[i-1][1][2]+dp[i-1][1][3];
    dp[i][3][2]= dp[i-1][2][1]+dp[i-1][2][2]+dp[i-1][2][3];
    REP(x,4)REP(y,4)dp[i][x][y]%=10000;
    REP(j,K){
      if(data[j]==i){
        switch (B[j]) {
          case 1 : FOR(l,1,4){dp[i][2][l]=0;dp[i][3][l]=0;}break;
          case 2 : FOR(l,1,4){dp[i][1][l]=0;dp[i][3][l]=0;}break;
          case 3 : FOR(l,1,4){dp[i][1][l]=0;dp[i][2][l]=0;}break;
        }
      }
    }
  }
  long long total=0;
    for(int j =1 ;j<=3;j++){
      for(int l =1;l<=3;l++){
        total += dp[N][j][l];
        total %= 10000;
        //cout << '[' <<j<<','<<l<<']'<<dp[N][j][l]<<endl;
      }

  }
  cout << total <<endl;

}
void solve(){
  cin >> N >> K;
  REP(i,K){
    cin >> data[i]>>B[i];
  }
  init();

}
int main(){
    solve();
}

C++: #include<iostream>
using namespace std;
#define M 10000
int N,K;
int dp[101][3][2];
int  t[101];

int main(){
  for(int i=0;i<=100;i++)t[i]=-1;
  for(int i=0;i<=100;i++)
    for(int j=0;j<3;j++)
      for(int k=0;k<3;k++)
	dp[i][j][k]=0;
  cin>>N>>K;
  for(int i=0;i<K;i++){
    int a,b;
    cin>>a>>b;
    t[a]=b-1;
  }
  
  for(int i=1;i<=N;i++){
    for(int j=0;j<3;j++){
      if(t[i]!=-1&&t[i]!=j)continue;
      if(i==1){
	dp[i][j][0]=1;
	continue;
      }
      dp[i][j][0]=
	(
	 dp[i-1][(j+1)%3][0]
	 +dp[i-1][(j+2)%3][0]
	 +dp[i-1][(j+1)%3][1]
	 +dp[i-1][(j+2)%3][1]
	 ) % M;
      dp[i][j][1]=dp[i-1][j][0];
	
    }
  }
  int ans=0;
  for(int i=0;i<3;i++)
    for(int j=0;j<2;j++)
      ans=(ans+dp[N][i][j])%M;
  cout<<ans<<endl;
  return 0;
}

C++: 
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
#include<bits/stdc++.h>
#define LL long long
#define FOR(i,a,b) for(int i=a;i<=b;++i)
 
using namespace std;
 
static const LL MAX_N = 1e+5;
static const LL INF = 1 << 25;
 
struct clothes{
    LL A[MAX_N],B[MAX_N],C[MAX_N];
};
 
int N,D;
LL res=-INF;
LL Day[MAX_N];
clothes T;
 
void cal(LL day,LL p,LL pp,LL sum){
    //cout<<sum+abs(pp-p)<<" "<<day<<" "<<p<<" "<<pp<<endl;
    if(res<sum+abs(pp-p))res=sum+abs(pp-p);
    if(day==N+1)return 0;
    if(day==0){
        FOR(i,1,D)
        if(Day[1]>=T.A[i]&&Day[1]<=T.B[i])cal(day+1,T.C[i],p,sum);
    }
    FOR(i,1,D){
        if(Day[day]>=T.A[i]&&Day[day]<=T.B[i]){
            if(day>2)cal(day+1,T.C[i],p,sum+abs(pp-p));
            else cal(day+1,T.C[i],p,sum);
        }
    }
    return res;
}
 
 
int main(){
    cin>>N>>D;
    FOR(i,1,N)cin>>Day[i];
    FOR(i,1,D)
        cin>>T.A[i]>>T.B[i]>>T.C[i];
        cal(0,0,0,0);
        cout<<res<<endl;
}