글 읽기 - 테스트 케이스 모두 통과 but 틀렸습니다

morningmemo 7년 전 0

테스트 케이스는 모두 통과하는데 1%에서 바로 틀렸다고 나오네요..
확인 한 번 부탁드려요..
#include <iostream>
#include <string>

using namespace std;

int N, M;
class Board{
private:
	bool bSuccess, bFinish;
	int *redLocation, *blueLocation;
	char** pBoard;
public:
	Board( char** pBoard)
	{
		this->pBoard = pBoard;
		this->blueLocation = new int[2];
		this->redLocation = new int[2];
		this->bFinish = false;
		this->bSuccess = false;
	}
	void move( int direction);

	void moveLeft( int* targetLocation);
	void moveRight( int* targetLocation);
	void moveTop( int* targetLocation);
	void moveBottom( int* targetLocation);

	void initBoard();

	bool isFinished();
	bool isSuccess();

	int* getRedLocation();
	int* getBlueLocation();
	void setBallLocation( int* blueLocation, int* redLocation);

	char** getBoard();
};

int* Board::getRedLocation()
{
	return this->redLocation;
}
int* Board::getBlueLocation()
{
	return this->blueLocation;
}

void Board::setBallLocation( int* blueLocation, int* redLocation)
{
	this->pBoard[ blueLocation[0]][ blueLocation[1]] = 'B';
	this->blueLocation[0] = blueLocation[0];
	this->blueLocation[1] = blueLocation[1];

	this->pBoard[ redLocation[0]][ redLocation[1]] = 'R';
	this->redLocation[0] = redLocation[0];
	this->redLocation[1] = redLocation[1];
}

char** Board::getBoard()
{
	return this->pBoard;
}

bool Board::isSuccess()
{
	return this->bSuccess;
}

bool Board::isFinished()
{
	return this->bFinish;
}

void Board::initBoard()
{
	this->bFinish = false;
	this->bSuccess = false;

	for( int i= 0; i < N; i++)
	{
		for( int j=0;j<M;j++)
		{
			if( this->pBoard[i][j] == 'B' || this->pBoard[i][j] == 'R')
				this->pBoard[i][j] = '.';
		}
	}
}

void Board::move( int direction)
{
	if( this->isFinished() == false)
	{
		int *firstMovedLocation, *secondMovedLocation;

		switch( direction)
		{
		case 0:
			if( this->redLocation[1] < this->blueLocation[1])
			{
				firstMovedLocation = this->redLocation;
				secondMovedLocation = this->blueLocation;
			}
			else
			{
				firstMovedLocation = this->blueLocation;
				secondMovedLocation = this->redLocation;
			}
			this->moveLeft( firstMovedLocation);
			if( this->isFinished())
				break;
			this->moveLeft( secondMovedLocation);
			break;
		case 1:
			if( this->redLocation[1] > this->blueLocation[1])
			{
				firstMovedLocation = this->redLocation;
				secondMovedLocation = this->blueLocation;
			}
			else
			{
				firstMovedLocation = this->blueLocation;
				secondMovedLocation = this->redLocation;
			}
			this->moveRight( firstMovedLocation);
			if( this->isFinished())
				break;
			this->moveRight( secondMovedLocation);
			break;
		case 2:
			if( this->redLocation[0] < this->blueLocation[0])
			{
				firstMovedLocation = this->redLocation;
				secondMovedLocation = this->blueLocation;
			}
			else
			{
				firstMovedLocation = this->blueLocation;
				secondMovedLocation = this->redLocation;
			}
			this->moveTop( firstMovedLocation);
			if( this->isFinished())
				break;
			this->moveTop( secondMovedLocation);
			break;
		case 3:
			if( this->redLocation[0] > this->blueLocation[0])
			{
				firstMovedLocation = this->redLocation;
				secondMovedLocation = this->blueLocation;
			}
			else
			{
				firstMovedLocation = this->blueLocation;
				secondMovedLocation = this->redLocation;
			}
			this->moveBottom( firstMovedLocation);
			if( this->isFinished())
				break;
			this->moveBottom( secondMovedLocation);
			break;
		}

		if( this->isSuccess() == true)
			this->bFinish = true;
	}
}

void Board::moveLeft( int* location)
{
	while( true)
	{
		char frontier = this->pBoard[ location[0]][ location[1] - 1];
		if( frontier == 'O')
		{
			if( this->pBoard[ location[0]][ location[1]] == 'B')
			{
				this->bFinish = true;
				this->bSuccess = false;
			}
			else
			{
				this->pBoard[ location[0]][ location[1]] = '.';
				this->bSuccess = true;
			}
			break;
		}
		else if( frontier == '.')
		{
			this->pBoard[ location[0]][ location[1] - 1] = this->pBoard[ location[0]][ location[1]];
			this->pBoard[ location[0]][ location[1]--] = '.';
		}
		else
			break;
	}
}

void Board::moveRight( int* location)
{
	while( true)
	{
		char frontier = this->pBoard[ location[0]][ location[1] + 1];
		if( frontier == 'O')
		{
			if( this->pBoard[ location[0]][ location[1]] == 'B')
			{
				this->bFinish = true;
				this->bSuccess = false;
			}
			else
			{
				this->pBoard[ location[0]][ location[1]] = '.';
				this->bSuccess = true;
			}
			break;
		}
		else if( frontier == '.')
		{
			this->pBoard[ location[0]][ location[1] + 1] = this->pBoard[ location[0]][ location[1]];
			this->pBoard[ location[0]][ location[1]++] = '.';
		}
		else
			break;
	}
}

void Board::moveTop( int* location)
{
	while( true)
	{
		char frontier = this->pBoard[ location[0] - 1][ location[1]];
		if( frontier == 'O')
		{
			if( this->pBoard[ location[0]][ location[1]] == 'B')
			{
				this->bFinish = true;
				this->bSuccess = false;
			}
			else
			{
				this->pBoard[ location[0]][ location[1]] = '.';
				this->bSuccess = true;
			}
			break;
		}
		else if( frontier == '.')
		{
			this->pBoard[ location[0] - 1][ location[1]] = this->pBoard[ location[0]][ location[1]];
			this->pBoard[ location[0]--][ location[1]] = '.';
		}
		else
			break;
	}
}

void Board::moveBottom( int* location)
{
	while( true)
	{
		char frontier = this->pBoard[ location[0] + 1][ location[1]];
		if( frontier == 'O')
		{
			if( this->pBoard[ location[0]][ location[1]] == 'B')
			{
				this->bFinish = true;
				this->bSuccess = false;
			}
			else
			{
				this->pBoard[ location[0]][ location[1]] = '.';
				this->bSuccess = true;
			}
			break;
		}
		else if( frontier == '.')
		{
			this->pBoard[ location[0] + 1][ location[1]] = this->pBoard[ location[0]][ location[1]];
			this->pBoard[ location[0]++][ location[1]] = '.';
		}
		else
			break;
	}
}
const int MAXTry = 9;
static bool Tree[MAXTry];
void DP( Board* pBoard, int blueLocation[2], int redLocation[2], int count)
{
	if( pBoard->isFinished() == false && count <= MAXTry)
	{
		int blueLocation_1[2], redLocation_1[2];
		int blueLocation_2[2], redLocation_2[2];
		int blueLocation_3[2], redLocation_3[2];
		int blueLocation_4[2], redLocation_4[2];

		pBoard->initBoard();
		pBoard->setBallLocation( blueLocation, redLocation);
		pBoard->move(0);
		redLocation_1[0] = pBoard->getRedLocation()[0];
		redLocation_1[1] = pBoard->getRedLocation()[1];
		blueLocation_1[0] = pBoard->getBlueLocation()[0];
		blueLocation_1[1] = pBoard->getBlueLocation()[1];
		if( pBoard->isFinished() && pBoard->isSuccess())
			Tree[ count] = true;
		else if( pBoard->isFinished() == false)
			DP( pBoard, blueLocation_1, redLocation_1, count + 1);

		pBoard->initBoard();
		pBoard->setBallLocation( blueLocation, redLocation);
		pBoard->move(1);
		redLocation_2[0] = pBoard->getRedLocation()[0];
		redLocation_2[1] = pBoard->getRedLocation()[1];
		blueLocation_2[0] = pBoard->getBlueLocation()[0];
		blueLocation_2[1] = pBoard->getBlueLocation()[1];
		if( pBoard->isFinished() && pBoard->isSuccess())
			Tree[ count] = true;
		else if( pBoard->isFinished() == false)
			DP( pBoard, blueLocation_2, redLocation_2, count + 1);


		pBoard->initBoard();
		pBoard->setBallLocation( blueLocation, redLocation);
		pBoard->move(2);
		redLocation_3[0] = pBoard->getRedLocation()[0];
		redLocation_3[1] = pBoard->getRedLocation()[1];
		blueLocation_3[0] = pBoard->getBlueLocation()[0];
		blueLocation_3[1] = pBoard->getBlueLocation()[1];
		if( pBoard->isFinished() && pBoard->isSuccess())
			Tree[ count] = true;
		else if( pBoard->isFinished() == false)
			DP( pBoard, blueLocation_3, redLocation_3, count + 1);


		pBoard->initBoard();
		pBoard->setBallLocation( blueLocation, redLocation);
		pBoard->move(3);
		redLocation_4[0] = pBoard->getRedLocation()[0];
		redLocation_4[1] = pBoard->getRedLocation()[1];
		blueLocation_4[0] = pBoard->getBlueLocation()[0];
		blueLocation_4[1] = pBoard->getBlueLocation()[1];
		if( pBoard->isFinished() && pBoard->isSuccess())
			Tree[ count] = true;
		else if( pBoard->isFinished() == false)
			DP( pBoard, blueLocation_4, redLocation_4, count + 1);
	}
}

int main()
{
	cin >> N;
	cin >> M;

	int redLocation[2];
	int blueLocation[2];

	char** board = new char*[N];
	for( int i= 0; i < N; i++)
	{
		board[i] = new char[M];
		for( int j=0;j<M;j++)
		{
			cin >> board[i][j];

			if( board[i][j] == 'B')
			{
				blueLocation[0] = i;
				blueLocation[1] = j;
				board[i][j] = '.';
			}
			else if( board[i][j] == 'R')
			{
				redLocation[0] = i;
				redLocation[1] = j;
				board[i][j] = '.';
			}
		}
	}

	Board* pBoard = new Board( board);

	Tree[0] = false;

	DP( pBoard, blueLocation, redLocation, 1);

	for( int i= 0; i <= MAXTry; i++)
	{
		if( Tree[i])
		{
			cout << i;
			exit(1);
		}
	}
	cout << -1;
}
zlzmsrhak 7년 전 0

코드를 복사+붙여넣기 방식으로 작성하는 대신, 반복문이나 변수, 인자 등을 효율적으로 사용하여 작성하는 것을 추천드립니다.
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

테스트 케이스 모두 통과 but 틀렸습니다

morningmemo 7년 전 0

zlzmsrhak 7년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
