글 읽기 - 어디서 틀렸는지 도저히 모르겠습니다. 도움 요청합니다!

kbw1101 3년 전 0

테스트 케이스는 다 통과했는데 64%에서 오류가 나네요...

대체 어디에서 틀렸는지 모르겠습니다ㅜㅜ!

도움 요청합니다!

#include <iostream>
#include <deque>
#include <algorithm>

using namespace std;

typedef pair<int, int> P;
typedef pair<P, int> PP;

int N, K;
int board[14][14] = { 0 };
deque<int> dq[14][14];
int turn = 0;

PP horses[11];

P dirs[5] = {
	{0, 0},
	{0, 1},
	{0, -1},
	{-1, 0},
	{1, 0}
};

void rotate(int i, int dir)
{
	if (dir == 1)
		horses[i].second = 2;
	else if (dir == 2)
		horses[i].second = 1;
	else if (dir == 3)
		horses[i].second = 4;
	else if (dir == 4)
		horses[i].second = 3;
}

int main(void)
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);

	for (int i = 0; i < 14; i++)
		for (int j = 0; j < 14; j++)
			board[i][j] = -1;

	cin >> N >> K;
	
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= N; j++)
			cin >> board[i][j];

	for (int i = 1; i <= K; i++)
	{
		int x, y, dir;
		cin >> x >> y >> dir;
		horses[i].first.first = x;
		horses[i].first.second = y;
		horses[i].second = dir;
		dq[x][y].push_back(i);
	}

	bool isEnd = false;

	while (true)
	{
		turn++;
		if (turn > 1000) break;

		// Horse move
		for (int i = 1; i <= K; i++)
		{
			int x = horses[i].first.first;
			int y = horses[i].first.second;
			int dir = horses[i].second;
			int newX = horses[i].first.first += dirs[dir].first;
			int newY = horses[i].first.second += dirs[dir].second;

			if (board[newX][newY] == 1 || board[newX][newY] == 0)
			{
				// Find Horse Idx
				int idx;
				for (idx = 0; idx < dq[x][y].size(); idx++)
				{
					if (dq[x][y][idx] == i)
						break;
				}

				// All Horse Move
				int moveCnt = 0;
				for (; idx < dq[x][y].size(); idx++)
				{
					horses[dq[x][y][idx]].first.first = newX;
					horses[dq[x][y][idx]].first.second = newY;
					dq[newX][newY].push_back(dq[x][y][idx]);
					moveCnt++;
				}

				while (moveCnt--)
					dq[x][y].pop_back();

				if (board[newX][newY] == 1)
				{
					// Find Horse Idx
					deque<int>::iterator iter = dq[newX][newY].begin();
					for (; iter != dq[newX][newY].end(); iter++)
					{
						if (*iter == i) break;
					}

					// Reverse!
					reverse(iter, dq[newX][newY].end());
				}
			}
			else if (board[newX][newY] == 2 || board[newX][newY] == -1)
			{
				rotate(i, dir);
				newX = x + dirs[horses[i].second].first;
				newY = y + dirs[horses[i].second].second;
				
				if (board[newX][newY] == 0 || board[newX][newY] == 1)
				{
					// Find Horse Idx
					int idx;
					for (idx = 0; idx < dq[x][y].size(); idx++)
					{
						if (dq[x][y][idx] == i)
							break;
					}

					// All Horse Move
					int moveCnt = 0;
					for (; idx < dq[x][y].size(); idx++)
					{
						horses[dq[x][y][idx]].first.first = newX;
						horses[dq[x][y][idx]].first.second = newY;
						dq[newX][newY].push_back(dq[x][y][idx]);
						moveCnt++;
					}

					while (moveCnt--)
						dq[x][y].pop_back();

					if (board[newX][newY] == 1)
					{
						// Find Horse Idx
						deque<int>::iterator iter = dq[newX][newY].begin();
						for (; iter != dq[newX][newY].end(); iter++)
						{
							if (*iter == i) break;
						}

						// Reverse!
						reverse(iter, dq[newX][newY].end());
					}
				}
			}

			// Print
			/*for (int j = 1; j <= K; j++)
			{
				cout << "(" << horses[j].first.first << "," << horses[j].first.second << "," << horses[j].second << ")" << " ";
			}
			cout << '\n';*/

			// End Check
			for (int j = 1; j <= N; j++)
			{
				for (int k = 1; k <= N; k++)
				{
					if (dq[j][k].size() >= 4)
					{
						cout << turn << '\n';
						return 0;
					}
				}
			}
		}
	}

	if (turn == 1001) cout << "-1\n";
	else cout << turn << '\n';

	return 0;
}

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

어디서 틀렸는지 도저히 모르겠습니다. 도움 요청합니다!

kbw1101 3년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말