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<bits/stdc++.h>
using namespace std;

int main() {
  const int M = 10000;

  int N, K;
  cin >> N >> K;
  vector<int> plan(N + 1, 0);
  for(int i = 1; i <= K; ++i) {
    int A, B;
    cin >> A >> B;
    plan[A] = B;
  }

  int dp[101][4][2] = {};
  dp[0][0][0] = 1;
  for(int i = 0; i < N; ++i) for(int j = 0; j <= 3;  ++j) for(int k = 0; k < 2; ++k) {
    if(plan[i + 1]) {
      if(j == plan[i + 1]) {
        if(k == 0) dp[i + 1][plan[i + 1]][1] = (dp[i + 1][plan[i + 1]][1] + dp[i][j][k]) % M;
      } else {
        dp[i + 1][plan[i + 1]][0] = (dp[i + 1][plan[i + 1]][0] + dp[i][j][k]) % M;
      }
    } else {
      for(int nj = 1; nj <= 3; ++nj) {
        if(k == 1 && j == nj) continue;
        if(j == nj) {
          dp[i + 1][nj][1] = (dp[i + 1][nj][1] + dp[i][j][k]) % M;
        } else {
          dp[i + 1][nj][0] = (dp[i + 1][nj][0] + dp[i][j][k]) % M;
        }
      }
    }
  }

  int ans = 0;
  for(int j = 0; j <= 3; ++j) for(int k = 0; k < 2; ++k) ans = (ans + dp[N][j][k]) % M;
  cout << ans << endl;
}

C++: #include <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#define value(x,y,w,h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(Type,Arg,W,H,Init) (vector<vector<(Type)>> Arg ((W),(vector<(Type)>(H,Init))))

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

typedef long long ll ;
typedef deque<int> di ;
typedef deque<ll> dl ;
typedef map<string,int> dict;
typedef complex<double> comd;
typedef pair<int,int> pii;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

  template <typename T>
void out(deque < T > d)
{
  for(size_t i = 0; i < d.size(); i++)
  {
    debug(d[i]);
  }
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void run(){
  //  ifstream cin("in");
  //  ofstream cout( "out" );
  int N,K;cin >>N >> K;

  map<int,int> dmap;
  rep(i,K){
    int a,b;cin >> a >> b;
    dmap[a]=b;
  }

  vector<vector<vector<int> >> dp(N+1,vector<vector<int> >(4,vector<int>(4)));
  for(int c=1;c<=3;c++){
    if((dmap.count(1) > 0 && dmap[1]==c) || dmap.count(1)==0)
      dp[1][c][0]=1;
  }
  for(int i=2;i<=N;i++){
    for(int c=1;c<=3;c++){
      if( (dmap.count(i) > 0 && dmap[i]==c) || dmap.count(i)==0){
        for(int pc1=1;pc1<=3;pc1++)for(int pc2=0;pc2<=3;pc2++){
          if(!(c==pc1 && pc1 ==pc2)){
            dp[i][c][pc1]+=dp[i-1][pc1][pc2];
            dp[i][c][pc1]%=10000;
            debug(dp[i][c][pc1]);
          }
        }
      }
    }
  }

  ll res=0;
  for(int c=1;c<=3;c++)for(int p=1;p<=3;p++){
    res+=dp[N][c][p];
    res%=10000;
  }

  cout << res<<endl;
}

int N,K,a,b;
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
//   run();

  cin >> N >> K;
  map<int,int> p;
  rep(i,K){
    cin >> a >> b;
    p[a] = b ;
  }
  vector<vector<vector<int>>> dp(N+1,vector<vector<int>>(4,vector<int>(4,0)));
  for(int i = 1; i <= 3;++i){
    if((p.count(1) > 0 && p[1] == i) || p.count(1) == 0){
      dp[1][i][0] = 1;
    }
  }
  for(int i = 2; i <= N; i++){
    for(int c = 1; c <= 3; ++c){
      if((p.count(i) > 0 &&p[i] == c)|| p.count(i) == 0){//c????????\???????£??????????
        for(int pc1 = 1; pc1 <= 3; ++pc1){//?????\
          for(int pc2 = 0; pc2<= 3; ++pc2){//????????\
            if(!(c == pc1 && pc1 == pc2)){//?????\??£?¶???§??????
              dp[i][c][pc1] += dp[i-1][pc1][pc2];
              dp[i][c][pc1] %= 10000;
            }
          }
        }
      }
    }
  }

  ll ans = 0;
  for(int i = 1; i <= 3; ++i){
    for(int j = 1; j <= 3; ++j){
      ans += dp[N][i][j];
      ans %= 10000;
    }
  }
  cout << ans << endl;
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <array>
#include <numeric>

int f(int, int, int);
int N;
int yotei[100];

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int k, date;
    std::cin >> N >> k;
    for (int i = 0; i < k; i++) {
        std::cin >> date;
        std::cin >> yotei[date];
    }

    std::cout << f(0, 0, 0);
    return 0;
}

int f(int day, int kinou, int ototui) {
    if (day == N) return 1;
    int ans = 0;

    for (int i = 1; i <= 3; i++) {
        if ((i == kinou && i == ototui) || (yotei[day] != 0 && i != yotei[day])) continue;

        ans += f(day + 1, i, kinou);
    }

    return ans;
}