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 <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include <fstream>
#include <cassert>
using namespace std;

//common

typedef int  i32;
typedef long long i64,ll;
typedef long double ld;

#define BR "\n"
#define ALL(c) (c).begin(),(c).end()
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,l,r) for(int i=(int)l;i<(int)(r);++i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))

//config
//#define NDEBUG
//#define INF 1<<30
//#define EPS 1e-8
//const ll MOD =100000007;

//debug
#ifdef NDEBUG
#define DUMP(x)
#define DUMPLN(x)
#define DEBUG(x)
#define DEBUGLN(x)
#define LINE()
#define LINELN()
#define CHECK(exp,act)
#define STOP(e)
#else
#define DUMP(x)  cerr << #x << " = " << (x)
#define DUMPLN(x)  DUMP(x) <<endl
#define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__
#define DEBUGLN(x) DEBUG(x)<<endl
#define LINE()    cerr<< " (L" << __LINE__ << ")"
#define LINELN()    LINE()<<endl
#define CHECK(exp,act)  if(exp!=act){DUMPLN(exp);DEBUGLN(act);}
#define STOP(e)  CHECK(e,true);if(!(e)) exit(1);
#endif

template<class T> inline string toString(const vector<T>& x) {
	stringstream ss;
	REP(i,x.size()){
		if(i!=0)ss<<" ";
		ss<< x[i];
	}
	return ss.str();
}

template<class T> inline string toString(const vector<vector<T> >& map) {
	stringstream ss;
	REP(i,map.size()){
		if(i!=0)ss<<BR;
		ss<< toString(map[i]);
	}
	return ss.str();
}
template<class K,class V>  string toString(map<K,V>& x) {
	string res;stringstream ss;
	for(auto& p:x)ss<< p.first<<":" << p.second<<" ";
	return ss.str();
}

string BITtoString(int bit){
    stringstream ss;
    while(bit!=0){ss<<(bit%2);bit/=2;}
    string res=ss.str();reverse(ALL(res));
    return res;
}

template<typename T,typename V> inline T pmod(T v,V MOD){
	return (v%MOD+MOD)%MOD;
}
#define nextInt(n) scanf("%d",&n)
#define defInt(n) int n;nextInt(n)
#define nextLong(n) scanf("%lld",&n)
#define defLong(n) ll n;nextLong(n)
#define nextDouble(n) scanf("%lf",&n)


class Main{
	public:
	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;
						}
					}
				}
			}
		}
	
		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 main(){
	cout <<fixed<<setprecision(3);	
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

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

int h,i,j,n,k,b,*p,y[81][5],u;
queue<int> q,w,e,r,t;

int main(){
	cin >> n >> k;
	p = new int[n+4];
	
	for(i=0; i<n+4; i++){
		p[i] = 0;
	}
	
	for(i=0; i<k; i++){
		cin >> b;
		cin >> p[b+1];
	}
	
	q.push(1);
	w.push(0);
	e.push(0);
	r.push((p[3])?p[3]:0);
	t.push((p[4])?p[4]:0);
	
	for(i=2; i<n+2; i++){
		b=0;
		for(; q.size(); ){
			for(h=1; h<4; h++){
				if(p[i]){
					y[b][0] = q.front();
					y[b][1] = e.front();
					y[b][2] = p[i];
					y[b][3] = t.front();
					y[b++][4] = (p[i+3])?p[i+3]:0;
					break;
				}else if(!((w.front() == h && e.front() == h) || (e.front() == h && h == r.front()) || (h == r.front() && h == t.front()))){
					y[b][0] = q.front();
					y[b][1] = e.front();
					y[b][2] = h;
					y[b][3] = t.front();
					y[b++][4] = (p[i+3])?p[i+3]:0;
				}
			}
			q.pop();
			w.pop();
			e.pop();
			r.pop();
			t.pop();
		}
		for(j=0; j<b; j++){
			if(y[j][0] != -1){
				for(h=0; h<b; h++){
					if((j != h)&&(y[j][1] == y[h][1])&&(y[j][2] == y[h][2])&&(y[j][3] == y[h][3])&&(y[j][4] == y[h][4])){
						y[j][0] += y[h][0];
						y[j][0] %= 10000;
						y[h][0] = -1;
					}
				}
				q.push(y[j][0]);
				w.push(y[j][1]);
				e.push(y[j][2]);
				r.push(y[j][3]);
				t.push(y[j][4]);
			}
		}
	}
	
	for(u=0; q.size(); ){
		u += q.front();
		q.pop();
	}
	
	cout << u%10000 << endl;
	return 0;
}