글 읽기 - 100%까지 통과한 후 틀렸습니다가 떴습니다

angu5552 6년 전 0

안녕하세요 해당코드에서 100%까지 채점완료 후 애러가 떴는데요
어느부분이 에러인지 테스트 케이스나 코드부분을 알려주시면
감사하겠습니다 ㅠㅠ
#include <iostream>
#include <vector>
#include <algorithm>
#include<iterator>
#define SETMAX 7
using namespace std;
int drow[4] = { -1,1,0,0 };
int dcol[4] = { 0,0,-1,1 };
char set[7] = { '|' ,'-','+','1','2','3','4' };
int MaxCol, MaxRow = 0;
int rest = 0;
char Map[26][26] = { {0,} };
int UsedMap[26][26] = { {0,}, };
class Light{
public:
	int row;
	int col;
	int direction;//상하좌우

	Light() {
		row = 0;
		col = 0;
		direction = 0;

	}
	Light(int r, int c, int d) {
		row = r;
		col = c;
		direction = d;
	}

};

int Answer;
Light light;
vector<Light> Lightlist;
bool isPossible(char a,int dir) {
	if (a == '.')return false;
	else if (dir == 0 && (a == '|' || a == '+' || a == '1' || a == '4'))return true;
	else if (dir == 1 && (a == '|' || a == '+' || a == '2' || a == '3'))return true;
	else if (dir == 2 && (a == '-' || a == '+' || a == '1' || a == '2'))return true;
	else if (dir == 3 && (a == '-' || a == '+' || a == '3' || a == '4'))return true;
	else return false;
}
int ChangeDirection(char a,Light *lig) {
	if ((int)a == 129) {
		switch (lig->direction) {
		case 3:return -1; break;
		case 4:return -1; break;
		default:break;
		}
	}
	else if (a == '-') {
		switch (lig->direction) {
		case 1:return -1; break;
		case 2:return -1; break;
		default:break;
		}
	}
	else if (a == '1') {
		switch (lig->direction) {
		case 0:lig->direction = 3; break;
		case 2:lig->direction = 1; break;
		default:return -1;  break;
		}
	}
	else if (a == '2') {
		switch (lig->direction) {
		case 1:lig->direction = 3; break;
		case 2:lig->direction = 0; break;
		default:return -1;  break;
		}
	}
	else if (a == '3') {
		switch (lig->direction) {
		case 1:lig->direction = 2; break;
		case 3:lig->direction = 0; break;
		default:return -1;  break;
		}
	}
	else if (a == '4') {
		switch (lig->direction) {
		case 0:lig->direction = 2; break;
		case 3:lig->direction = 1; break;
		default:return -1;  break;
		}
	}
	return 0;
};
void copyMatrix(int (*tar)[26], int (*src)[26]) {
	for (int i = 0; i < 26; i++) {
		for (int j = 0; j < 26; j++) {
			tar[i][j] = src[i][j];
		}
	}
}
void findHackedBlock() {
	//1. M 주변에 지나갈수 있는 길을 찾는다;
	int i = 0;
	for (; i < 4; i++) {
		int nrow = light.row+drow[i];
		int ncol = light.col+dcol[i];
		if (nrow > -1 && nrow < MaxRow && ncol > -1 && ncol < MaxCol) {
			if (isPossible(Map[nrow][ncol],i)) {
				light.row = nrow;
				light.col = ncol;
				light.direction = i;
				ChangeDirection(Map[nrow][ncol], &light);
				
				break;
			}
		}
	}
	if (i < 4) {
		do {
			if (UsedMap[light.row][light.col] != 1) rest--;
			
			UsedMap[light.row][light.col] = 1;
			light.row = light.row + drow[light.direction];
			light.col = light.col + dcol[light.direction];
			ChangeDirection(Map[light.row][light.col],&light);
		} while (Map[light.row][light.col] != '.');
		Lightlist.push_back(Light(light.row, light.col, light.direction));
	}
	else {
		for (int j = 0; j < 4; j++) {
			int nrow = light.row + drow[j];
			int ncol = light.col + dcol[j];
			if (nrow > -1 && nrow < MaxRow && ncol > -1 && ncol < MaxCol) {
				Lightlist.push_back(Light(nrow, ncol, j));
			}
		}
	}
}

char findpipe() {
	vector<Light>::iterator it=Lightlist.begin();
	for (; it != Lightlist.end(); it++) {
		
		int i = 0;
		for (; i < 7; i++) {
			Light tempLight = *it;
			if (isPossible(set[i], tempLight.direction)) {
				int tempUsedMap[26][26] = { {0,} };
				copyMatrix(tempUsedMap, UsedMap);
				int temprest = rest;
				Map[it->row][it->col] = set[i];
				UsedMap[it->row][it->col] = 1;
				ChangeDirection(set[i], &tempLight);
				tempLight.col = tempLight.col + dcol[tempLight.direction];
				tempLight.row = tempLight.row + drow[tempLight.direction];

				while (
					
					tempLight.row > -1 && tempLight.row < MaxRow
					&& tempLight.col > -1 && tempLight.col<MaxCol
					&& Map[tempLight.row][tempLight.col] != '.'
					&& Map[tempLight.row][tempLight.col] != 'Z'
					&& isPossible(Map[tempLight.row][tempLight.col],tempLight.direction)
					)
				{
					if (UsedMap[tempLight.row][tempLight.col] != 1) { 
						UsedMap[tempLight.row][tempLight.col] = 1;
						temprest--; 
					}
					ChangeDirection(Map[tempLight.row][tempLight.col],&tempLight);
					tempLight.col = tempLight.col + dcol[tempLight.direction];
					tempLight.row = tempLight.row + drow[tempLight.direction];
				}
				if (Map[tempLight.row][tempLight.col] == 'Z'&&temprest==0) {
					light = Light(it->row, it->col, it->direction);
					return set[i];
				}
				copyMatrix(UsedMap, tempUsedMap);
				Map[it->row][it->col] = '.';
			}
		}
	}
}

int main(int argc, char** argv)
{



	

	Answer = 0;
	cin >> MaxRow >> MaxCol;
	for (int i = 0; i < MaxRow; i++) {
		cin >> Map[i];
		int j = 0;
		for (; j < MaxCol; j++) {
			if (Map[i][j] == 'M')light = Light(i, j, 0);
			for (int k = 0; k < SETMAX; k++) {
				if (Map[i][j] == set[k])rest++;
			}
		}
		Map[i][j] = '\0';
	}
	findHackedBlock();
	cout << light.row + 1 <<" " <<  light.col + 1 <<" " << findpipe() <<  endl;


	return 0;
}
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

100%까지 통과한 후 틀렸습니다가 떴습니다

angu5552 6년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
