BOJ 17837. 새로운 게임2

1
2
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>

using namespace std;

#define MAX_N 15
#define MAX_K 12

#define WHITE 0
#define RED 1
#define BLUE 2

#define MIN_GOAL_SIZE 4

int board[MAX_N][MAX_N];
vector<int> vec[MAX_N][MAX_N];

int N, K;

int dx[4] = {0,  0, -1, 1};
int dy[4] = {1, -1,  0, 0};

struct Marker{
	int r, c, dir, idx;
};

Marker marker[MAX_K];


int simulation()
{
	for (int cnt = 1; cnt <= 1000; cnt++)
	{
		for (int i = 0; i < K; i++)
		{
			int r = marker[i].r;
			int c = marker[i].c;
			int dir = marker[i].dir;
			int idx = marker[i].idx;

			int nr = r + dx[dir];
			int nc = c + dy[dir];
	
			if (board[nr][nc] == WHITE)
			{
				vector<int> &nextVec = vec[nr][nc];
				vector<int> &curVec = vec[r][c];

				for (int j = idx; j < curVec.size(); j++)
				{
					int curMarker = curVec[j];
					marker[curMarker].r = nr;
					marker[curMarker].c = nc;
					marker[curMarker].idx = nextVec.size();
					nextVec.push_back(curMarker);
				}
				
				curVec.erase(curVec.begin() + idx, curVec.end());
			}
			else if (board[nr][nc] == RED)
			{
				vector<int> &nextVec = vec[nr][nc];
				vector<int> &curVec = vec[r][c];

				vector<int> reverseVec;
				reverseVec.insert(reverseVec.end(), curVec.begin() + idx, curVec.end());
				reverse(reverseVec.begin(), reverseVec.end());

				for (int j = 0; j < reverseVec.size(); j++)
				{
					int curMarker = reverseVec[j];
					marker[curMarker].r = nr;
					marker[curMarker].c = nc;
					marker[curMarker].idx = nextVec.size();
					nextVec.push_back(curMarker);
				}

				curVec.erase(curVec.begin() + idx, curVec.end());
			}
			else // BLUE
			{
				int reverseDir;
				if (dir % 2 == 0)
					dir++;
				else
					dir--;

				marker[i].dir = dir;
				int pr = r + dx[dir];
				int pc = c + dy[dir];

				if (board[pr][pc] != BLUE)
					i--;

				continue;
			}

			if (vec[nr][nc].size() >= MIN_GOAL_SIZE)
				return cnt;
		}
	}
	return -1;
}


int main()
{
	freopen("in.txt", "r", stdin);

	scanf("%d%d", &N, &K);
	for (int i = 0; i <= N+1; i++)
	{
		board[i][0] = board[0][i] = BLUE;
		board[N+1][i] = board[i][N+1] = BLUE;
	}

	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			scanf("%d", &board[i][j]);

	for (int i = 0; i < K; i++)
	{
		int r, c, d;
		scanf("%d%d%d", &r, &c, &d);

		marker[i].r = r;
		marker[i].c = c;
		marker[i].dir = d-1;
		marker[i].idx = 0;
		
		vec[r][c].push_back(i);
	}

	printf("%d\n", simulation());
	return 0;
}