주사위 굴리기 2

https://www.acmicpc.net/problem/23288

23288번: 주사위 굴리기 2

#include <iostream>
#include <vector>
#include <cstring>

using namespace std;

const int MAX = 22;
int n, m;
int map[MAX][MAX];
int answer = 0;
pair<int, int> loc;
int curdir = 1; //1:동, 2:서 3:남 4:북
struct MOVE { int x, y; };
MOVE mv[5] = { {-1,-1}, {0,1}, {0,-1}, {1,0}, {-1,0} };
vector<int> turn;
int value = 0;
int visited[MAX][MAX];

void MoveDice() {
	bool flag = false;

	while (flag == false) {
		int movei = loc.first + mv[curdir].x;
		int movej = loc.second + mv[curdir].y;

		if (movei >= 1 && movei <= n && movej >= 1 && movej <= m) {
			loc = make_pair(movei, movej);
			if (curdir == 1) {
				vector<int> tmp;
				tmp.push_back(turn[1]);
				tmp.push_back(turn[5]);
				tmp.push_back(turn[0]);
				tmp.push_back(turn[3]);
				tmp.push_back(turn[4]);
				tmp.push_back(turn[2]);
				turn = tmp;
			}
			else if (curdir == 2) {
				vector<int> tmp;
				tmp.push_back(turn[2]);
				tmp.push_back(turn[0]);
				tmp.push_back(turn[5]);
				tmp.push_back(turn[3]);
				tmp.push_back(turn[4]);
				tmp.push_back(turn[1]);
				turn = tmp;
			}
			else if (curdir == 3) {
				vector<int> tmp;
				tmp.push_back(turn[3]);
				tmp.push_back(turn[1]);
				tmp.push_back(turn[2]);
				tmp.push_back(turn[5]);
				tmp.push_back(turn[0]);
				tmp.push_back(turn[4]);
				turn = tmp;
			}
			else if (curdir == 4) {
				vector<int> tmp;
				tmp.push_back(turn[4]);
				tmp.push_back(turn[1]);
				tmp.push_back(turn[2]);
				tmp.push_back(turn[0]);
				tmp.push_back(turn[5]);
				tmp.push_back(turn[3]);
				turn = tmp;
			}
			flag = true;
		}
		else {
			if (curdir == 1)	curdir = 2;
			else if (curdir == 2)	curdir = 1;
			else if (curdir == 3)	curdir = 4;
			else if (curdir == 4) curdir = 3;
		}
	}
}

void dfs(pair<int, int> l,int v) {
	for (int k = 1; k <= 4; k++) {
		int movei = l.first + mv[k].x;
		int movej = l.second + mv[k].y;

		if (movei >= 1 && movei <= n && movej >= 1 && movej <= m) {
			if (visited[movei][movej] == -1 && map[movei][movej] == v) {
				visited[movei][movej] = 1;
				value += 1;
				dfs({ movei,movej }, v);
			}
		}
	}
}

void GetScore() {
	value = 1;
	memset(visited, -1, sizeof(visited));

	visited[loc.first][loc.second] = 1;
	dfs(loc,map[loc.first][loc.second]);

	value = value * map[loc.first][loc.second];
	answer += value;
}

void NextDir() {
	int A = turn[5];
	int B = map[loc.first][loc.second];
	//1:동, 2:서 3:남 4:북
	if (A > B) {
		if (curdir == 1)	curdir = 3;
		else if (curdir == 2)	curdir = 4;
		else if (curdir == 3)	curdir = 2;
		else if (curdir == 4)	curdir = 1;
	}
	else if (A < B) {
		if (curdir == 1)	curdir = 4;
		else if (curdir == 2)	curdir = 3;
		else if (curdir == 3)	curdir = 1;
		else if (curdir == 4)	curdir = 2;
	}
}

int main(void) {
	int testcase;

	cin >> n >> m >> testcase;

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> map[i][j];
		}
	}

	loc = make_pair(1, 1);
	turn.push_back(1);
	turn.push_back(4);
	turn.push_back(3);
	turn.push_back(2);
	turn.push_back(5);
	turn.push_back(6);

	for (; testcase > 0; testcase--) {
		MoveDice();
		GetScore();
		NextDir();
	}

	cout << answer << endl;
}