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<iostream>
#include<algorithm>
using namespace std;
bool map[101][3];
int dp[101][3];
int main(){
	int n,k;
	cin>>n>>k;
	for(int i=0;i<n;i++){
		for(int j=0;j<3;j++){
			map[i][j]=true;
			dp[i][j]=0;
		}
	}
	int a,b;
	for(int i=0;i<k;i++){
		cin>>a>>b;
		for(int j=0;j<3;j++){
			if(j+1!=b){
				map[a-1][j]=false;
			}
		}
	}
	int sum0=0;
	for(int j=0;j<3;j++){
		dp[0][j]=map[0][j];
		sum0+=dp[0][j];
	}
	int sum1=0;
	for(int j=0;j<3;j++){
		if(map[1][j]==true){
			dp[1][j]=sum0;
		}
		sum1+=dp[1][j];
	}
	for(int j=0;j<3;j++){
		if(map[2][j]==true){
			dp[2][j]=sum1;
			if(map[0][j]==true&&map[1][j]==true){
				dp[2][j]-=dp[0][j];
			}
		}
	}
	for(int i=3;i<n;i++){
		for(int j=0;j<3;j++){
			if(map[i][j]==true){
				int sum=0;
				for(int r=0;r<3;r++){
					sum+=dp[i-1][r];
				}
				dp[i][j]=sum;
				if(map[i-1][j]==true&&map[i-2][j]==true){
					for(int r=0;r<3;r++){
						if(r!=j){
							dp[i][j]-=dp[i-3][r];
						}
					}
				}
			}
			dp[i][j]=dp[i][j]%10000;
			if(dp[i][j]<0)dp[i][j]+=10000;
		}
	}
	int ans=0;
	for(int j=0;j<3;j++){
		ans+=dp[n-1][j];
	}
	cout<<ans%10000<<endl;
	return 0;
}

C++: #include<iostream>
#include<cstring>
using namespace std;

int main(){
	int n,m,d[1000],t[1000],type[4][100],c[4][100];
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>d[i]>>t[i];
	}
	for(int i=0;i<m;i++){
		if(d[i]==1){
			type[i][1]=1;
			goto Exit1;
		}
	}
	type[1][1]=1;
	type[2][1]=1;
	type[3][1]=1;
	
Exit1:
	for(int i=1;i<=3;i++){
		if(type[i][1]!=1){
			type[i][1]=0;
		}
	}
	type[1][2]=0;
	type[2][2]=0;
	type[3][2]=0;
	for(int i=2;i<=n;i++){
		for(int j=0;j<m;j++){

			if(d[j]==i){
				type[t[j]][2]=type[t[j]][1];
				type[t[j]][1]=0;
				for(int k=1;k<=3;k++){
					if(t[j]!=k){
						for(int l=1;l<=2;l++){
						type[t[j]][1] += type[k][l];
						type[k][l]=0;
						}
					}
				}
				goto Exit2;
			}

		}
		memset(c,0,sizeof(c));
		for(int k=1;k<=3;k++){
			for(int l=1;l<=3;l++){
				if(k==l){
					c[l][2] += type[k][1];
				}
				else{
					c[l][1] += type[k][1]+type[k][2];
				}
			}
		}
		for(int k=1;k<=3;k++){
			type[k][1]=c[k][1];
			type[k][2]=c[k][2];
		}
Exit2:
		for(int j=1;j<=3;j++){
			for(int k=1;k<=2;k++){
				type[j][k]=type[j][k]%10000;
			}
		}
	}
	cout<<(type[1][1]+type[1][2]+type[2][1]+type[2][2]+type[3][1]+type[3][2])%10000<<endl;
	return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

const int MOD = 10000;

int main()
{
    int n, k;
    cin >> n >> k;

    vector<int> decide(n+1, -1);
    for(int i=0; i<k; ++i){
        int a, b;
        cin >> a >> b;
        decide[a] = b;
    }

    vector<vector<int> > dp(n+1, vector<int>(16, 0));
    dp[0][0] = 1;
    for(int i=0; i<n; ++i){
        for(int j=0; j<16; ++j){
            int a = j / 4;
            int b = j % 4;

            for(int c=1; c<=3; ++c){
                if(decide[i+1] != -1 && decide[i+1] != c)
                    continue;
                if(a == b && b == c)
                    continue;
                dp[i+1][b*4+c] += dp[i][j];
                dp[i+1][b*4+c] %= MOD;
            }
        }
    }

    int ret = accumulate(dp[n].begin(), dp[n].end(), 0);
    ret %= MOD;
    cout << ret << endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n,m;
  cin >> n >> m;
  int pas[n+1];
  for(int i=0;i<=n;i++) pas[i] = 0;
  int d,c;
  for(int i=0;i<m;i++){
    cin >> d >> c;
    pas[d] = c;
  }
  int pd[2][3]={0,0};
  int mem[2][3]={0,0};
  if(pas[1]==0) pd[0][0]=pd[0][1]=pd[0][2]=1;
  else pd[0][pas[1]-1]=1;
  for(int i=2;i<=n;i++){
    if(pas[i]==0||pas[i]==1){
      mem[0][0] = pd[0][1]+pd[1][1]+pd[0][2]+pd[1][2];
      mem[1][0] = pd[0][0];
    }
    if(pas[i]==0||pas[i]==2){
      mem[0][1] = pd[0][0]+pd[1][0]+pd[0][2]+pd[1][2];
      mem[1][1] = pd[0][1];
    }
    if(pas[i]==0||pas[i]==3){
      mem[0][2] = pd[0][0]+pd[1][0]+pd[0][1]+pd[1][1];
      mem[1][2] = pd[0][2];
    }
    for(int i=0;i<2;i++){
      for(int j=0;j<3;j++){
	pd[i][j] = mem[i][j]%10000;
	mem[i][j] = 0;
      }
    }
  }
  int ans = 0;
  for(int i=0;i<2;i++){
    for(int j=0;j<3;j++) ans += pd[i][j];
  }
  ans %= 10000;
  cout << ans << endl;
  return 0;
}