글 읽기 - 제코드에서 예외케이스가 통과됩니다.

xotjd183 7년 전 0

B0011
B0000
01000
EEE10
이 예제의 경우 통과 하지 않아야 하는데
예외는 없어서 그런지 통과하네요
확인해서 반영부탁드립니다.
통과를 안해야하는데 통과한 코드 올려둡니다.
#include <cstdio>
#include <queue>
using namespace std;
#define MAX 50
#define V 0
#define H 1
#define TREE '1'
#define ROAD '0'
#define ST 'B'
#define ED 'E'

typedef struct Tree{
    pair<int, int> pos[3];
    int state;
};

int N, TC, direct[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
bool visit[2][MAX][MAX][MAX][MAX];
char map[MAX][MAX];

Tree src, dest;

void init(){
    for(int state = 0; state<2; state++){
        for(int startI = 0; startI < MAX; startI++){
            for(int startJ = 0; startJ < MAX; startJ++){
                for(int endI = 0; endI < MAX; endI++){
                    for(int endJ = 0; endJ < MAX; endJ++){
                        visit[state][startI][startJ][endI][endJ] = false;
                    }
                }
            }
        }
    }
    for(int i = 0; i<MAX; i++)
        for(int j = 0; j<MAX; j++)
            map[i][j] = 0;
}

void input(){
    char iData[MAX+1];
    int stCnt = 0, edCnt = 0;
    scanf("%d", &N);
    
    for(int i = 0; i<N; i++){
        scanf("%s", iData);
        for(int j = 0; j<N; j++){
            map[i][j] = iData[j];
            if(map[i][j] == ST && stCnt < 3){
                src.pos[stCnt++] = make_pair(i, j);
                map[i][j] = ROAD;
            }else if(map[i][j] == ED && edCnt < 3){
                dest.pos[edCnt++] = make_pair(i,j);
                map[i][j] = ROAD;
            }
        }
    }
    if(src.pos[0].first == src.pos[1].first) src.state = H;
    else src.state = V;
    if(dest.pos[0].first == dest.pos[1].first) dest.state = H;
    else dest.state = V;
}
bool isEqual(Tree &t){
    if(t.pos[0].first == dest.pos[0].first && t.pos[0].second == dest.pos[0].second)
        if(t.pos[2].first == dest.pos[2].first && t.pos[2].second == dest.pos[2].second)
            return true;
    return false;
}
bool isMove(Tree &copy, int unitI, int unitJ){
    for(int k = 0; k<3; k++){
        copy.pos[k].first += unitI;
        copy.pos[k].second += unitJ;
        if(copy.pos[k].first < 0 || copy.pos[k].second < 0 || copy.pos[k].first >= N || copy.pos[k].second >= N)
            return false;
    }
    
    if(copy.state == V){
        // 여기 예외가 발생하는데 통과를 했음....
        if(map[copy.pos[2].first][copy.pos[2].second]  == TREE || map[copy.pos[0].first][copy.pos[0].second] == TREE) return false;
        return true;
    }else{
        int i1, i2, i3, j1, j2, j3;
        i1 = copy.pos[0].first, j1 = copy.pos[0].second;
        i2 = copy.pos[1].first, j2 = copy.pos[1].second;
        i3 = copy.pos[2].first, j3 = copy.pos[2].second;
        if(map[i1][j1] == TREE || map[i2][j2] == TREE|| map[i3][j3] == TREE) return false;
        return true;
    }
}
bool isRotate(Tree &copy){
    if(copy.pos[1].first == 0 || copy.pos[1].second == 0 || copy.pos[1].first == N-1 || copy.pos[1].second == N-1)
        return false;
    
    if(copy.state == V){
        int ui1, ui2, ui3, uj1, uj2, uj3;
        int bi1, bi2, bi3, bj1, bj2, bj3;
        ui1 = copy.pos[0].first, uj1 = copy.pos[0].second-1;
        ui2 = copy.pos[1].first, uj2 = copy.pos[1].second-1;
        ui3 = copy.pos[2].first, uj3 = copy.pos[2].second-1;
        
        bi1 = copy.pos[0].first, bj1 = copy.pos[0].second +1;
        bi2 = copy.pos[1].first, bj2 = copy.pos[1].second +1;
        bi3 = copy.pos[2].first, bj3 = copy.pos[2].second +1;
        
        if(map[ui1][uj1]==TREE || map[ui2][uj2]==TREE || map[ui3][uj3]==TREE) return false;
        if(map[bi1][bj1]==TREE || map[bi2][bj2]==TREE || map[bi3][bj3]==TREE) return false;
        
        copy.pos[0].first++, copy.pos[0].second--;
        copy.pos[2].first--, copy.pos[2].second++;
        copy.state = H;
        return true;
    }else{
        int ui1, ui2, ui3, uj1, uj2, uj3;
        int bi1, bi2, bi3, bj1, bj2, bj3;
        ui1 = copy.pos[0].first - 1, uj1 = copy.pos[0].second;
        ui2 = copy.pos[1].first - 1, uj2 = copy.pos[1].second;
        ui3 = copy.pos[2].first - 1, uj3 = copy.pos[2].second;
        
        bi1 = copy.pos[0].first + 1, bj1 = copy.pos[0].second;
        bi2 = copy.pos[1].first + 1, bj2 = copy.pos[1].second;
        bi3 = copy.pos[2].first + 1, bj3 = copy.pos[2].second;
        
        if(map[ui1][uj1]==TREE || map[ui2][uj2]==TREE || map[ui3][uj3]==TREE) return false;
        if(map[bi1][bj1]==TREE || map[bi2][bj2]==TREE || map[bi3][bj3]==TREE) return false;
        
        copy.pos[0].first--, copy.pos[0].second++;
        copy.pos[2].first++, copy.pos[2].second--;
        copy.state = V;
        return true;
    }
}
void result(){
    queue<Tree> q;
    bool isFind = false;
    int cnt= 0;
    q.push(src);
    visit[src.state][src.pos[0].first][src.pos[0].second][src.pos[2].first][src.pos[2].second] = true;
    while(!q.empty()){
        int qSize = (int)q.size();
        while(qSize--){
            Tree tree = q.front();
            q.pop();
            if(isEqual(tree)){
                isFind = true;
                break;
            }
            for(int k = 0; k<5; k++){
                Tree copy = tree;
                if(k < 4){
                    if(isMove(copy, direct[k][0], direct[k][1])){
                        if(!visit[copy.state][copy.pos[0].first][copy.pos[0].second][copy.pos[2].first][copy.pos[2].second]){
                            visit[copy.state][copy.pos[0].first][copy.pos[0].second][copy.pos[2].first][copy.pos[2].second] = true;
                            q.push(copy);
                        }
                    }
                }else if(isRotate(copy)){
                    if(!visit[copy.state][copy.pos[0].first][copy.pos[0].second][copy.pos[2].first][copy.pos[2].second]){
                        visit[copy.state][copy.pos[0].first][copy.pos[0].second][copy.pos[2].first][copy.pos[2].second] = true;
                        q.push(copy);
                    }
                }
            }
        }
        if(isFind) break;
        cnt++;
    }
    if(!isFind) cnt = 0;
    printf("%d\n", cnt);
    
}

int main(){
    TC = 1;
    while(TC--){
        init();
        input();
        result();
    }
    return 0;
}
baekjoon 7년 전 0

재채점중입니다.
https://www.acmicpc.net/rejudg...
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

제코드에서 예외케이스가 통과됩니다.

xotjd183 7년 전 0

baekjoon 7년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
