글 읽기 - 99%에서 자꾸 틀렸다고 뜹니다..

apdh25 4년 전 0

최대한 오류를 찾아보려고 하는데 아직 문제점을 잘 못찾겠네요.. 한번만 봐주시면 감사드리겠습니다ㅜ.ㅜ

#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>

using namespace std;

typedef pair<int, int> Pair;
typedef pair<bool, bool> Hole_Pair;

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

int n, m;

vector<vector<char>>board = vector<vector<char>>(11, vector<char>(11));

bool visited[101][101][101][101];

struct Marble {
	Pair blue_marble;
	Pair red_marble;
	Hole_Pair hole;
	int step;
	string move_way = "";
};

Marble marble;

void move_redmarble(Marble& marble, int way)
{
	int idx1 = marble.red_marble.first;
	int idx2 = marble.red_marble.second;

	while (board[idx1 + dx[way]][idx2 + dy[way]] != '#' && (idx1 + dx[way] !=
		marble.blue_marble.first || idx2 + dy[way] != marble.blue_marble.second))
	{
		if (board[idx1 + dx[way]][idx2 + dy[way]] == 'O') {
			marble.hole.first = true;
		}
		idx1 += dx[way];
		idx2 += dy[way];
	}
	marble.red_marble.first = idx1;
	marble.red_marble.second = idx2;
}

void move_bluemarble(Marble& marble, int way)
{
	int idx1 = marble.blue_marble.first;
	int idx2 = marble.blue_marble.second;

	while (board[idx1 + dx[way]][idx2 + dy[way]] != '#' && (idx1 + dx[way] !=
		marble.red_marble.first || idx2 + dy[way] != marble.red_marble.second))
	{
		if (board[idx1 + dx[way]][idx2 + dy[way]] == 'O') {
			marble.hole.second = true;
		}
		idx1 += dx[way];
		idx2 += dy[way];
	}
	marble.blue_marble.first = idx1;
	marble.blue_marble.second = idx2;
}

void bfs()
{
	queue<Marble> q;
	visited[marble.red_marble.first][marble.red_marble.second][marble.blue_marble.first][marble.blue_marble.second] = true;
	q.push(marble);

	while (q.empty() != true)
	{
		Marble temp_marble = q.front();
		q.pop();
 
		if (temp_marble.step > 10) {
			break;
		}

		if (temp_marble.hole.second) {
			continue;
		}
		
		if (temp_marble.hole.first)
		{
			cout << 1 << endl;
			//cout << temp_marble.move_way << endl;
			return;
		}

		for (int i = 0; i < 4; i++)
		{
			Marble next_marble = temp_marble;
			string way;

			if (i == 0) {
				//동
				way = "R";

				if (next_marble.red_marble.second > next_marble.blue_marble.second) {
					move_redmarble(next_marble, i);
					move_bluemarble(next_marble, i);
				}
				else {
					move_bluemarble(next_marble, i);
					move_redmarble(next_marble, i);
				}	
			}
			else if (i == 1) {
				//서
				way = "L";

				if (next_marble.red_marble.second < next_marble.blue_marble.second) {
					move_redmarble(next_marble, i);
					move_bluemarble(next_marble, i);
				}
				else {
					move_bluemarble(next_marble, i);
					move_redmarble(next_marble, i);
				}
			}
			else if (i == 2) {
				//남
				way = "D";

				if (next_marble.red_marble.first > next_marble.blue_marble.first) {
					move_redmarble(next_marble, i);
					move_bluemarble(next_marble, i);
				}
				else {
					move_bluemarble(next_marble, i);
					move_redmarble(next_marble, i);
				}
			}
			else {
				//북
				way = "U";

				if (next_marble.red_marble.first < next_marble.blue_marble.first) {
					move_redmarble(next_marble, i);
					move_bluemarble(next_marble, i);
				}
				else {
					move_bluemarble(next_marble, i);
					move_redmarble(next_marble, i);
				}
			}
			
			if (visited[next_marble.red_marble.first][next_marble.red_marble.second][next_marble.blue_marble.first][next_marble.blue_marble.second] != true) {
				visited[next_marble.red_marble.first][next_marble.red_marble.second][next_marble.blue_marble.first][next_marble.blue_marble.second] = true;
				next_marble.step += 1;
				next_marble.move_way += way;
				q.push(next_marble);
			}
		}
	}
	cout << 0 << endl;
}

int main()
{
	cin >> n >> m;


	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin >> board[i][j];
			if (board[i][j] == 'R') marble.red_marble = Pair(i, j);
			else if (board[i][j] == 'B') marble.blue_marble = Pair(i, j);
			else if (board[i][j] == 'O') marble.hole = Hole_Pair(false, false);
		}
	}

	bfs();

	return 0;
}

apdh25 4년 전 1

차라리 처음부터 틀리면 미련이 없겠는데 나름 스스로 열심히 코드짜고 정답에 확신이 마지막에서 ...미련도남고 슬프네요 ;ㅁ;

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

문제

문제

출처

ICPC

99%에서 자꾸 틀렸다고 뜹니다..

apdh25 4년 전 0

apdh25 4년 전 1

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말