[BOJ 17837] 새로운 게임 2

백준 :: BOJ :: 17837 :: 새로운 게임 2

 

출처 : https://www.acmicpc.net/problem/17837

17837번: 새로운 게임 2

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

#define F(p,q,r) for(int p=q; p<r; p++)
struct S { int y, x, d; };
int N, K,a,b,c,t,fl, A[14][14], dir[5][2] = { {},{0,1},{0,-1},{-1,0},{1,0} };
deque<int> B[14][14]; S C[11];

int main() {
	cin >> N >> K;
	F(i, 0, N + 2) {
		F(j, 0, N + 2) {
			if (!i || !j || i > N || j > N) A[i][j] = 2;
			else cin >> A[i][j];
		}
	}
	F(i, 0, K) {
		cin >> C[i].y >> C[i].x >> C[i].d; B[C[i].y][C[i].x].push_back(i);
	}
	while (t++ < 1000) {
		F(i, 0, K) {
			a = C[i].y, b = C[i].x, c = C[i].d;
			a += dir[c][0]; b += dir[c][1]; int si = C[i].y, sj = C[i].x;
			if (A[a][b] > 1) {
				c += 1; if (c == 3)c = 1; if (c == 5)c = 3; C[i].d = c;
				a += dir[c][0]; b += dir[c][1];
				if(A[a+dir[c][0]][b+dir[c][1]]<2) a += dir[c][0], b += dir[c][1];			
			}
			int f, D=0,l=B[si][sj].size(), s=0;
			if (A[a][b] == 1) {
				for (int j = l - 1; j >= 0; j--) {
					s = B[si][sj][j]; C[s].y = a; C[s].x = b;
					B[a][b].push_back(s); B[si][sj].pop_back();
					 if (s == i)break;
				}
			}
			else {
				F(j, 0, l) {
					f = B[si][sj][j]; if (f == i) s = 1;
					if (s == 1) {
						C[f].y = a; C[f].x = b; B[a][b].push_back(f); D++;
					}
				}
				while (D-- > 0) B[si][sj].pop_back();
			}
			if (B[a][b].size() >= 4) { fl = 1; break; }
		}
		if (fl)break;
	}
	cout << ((t > 1000)?-1:t);
	return 0;
}