백준 6087 레이저 통신

https://www.acmicpc.net/problem/6087

6087번: 레이저 통신

#include<stdio.h>
#include<string.h>
#include<queue>
#define NSIZE 100
#define MSIZE 100
using namespace std;
char input[NSIZE][MSIZE];
int chk[NSIZE][MSIZE];
int N, M;
int sy, sx,ey,ex;
int dy[] = {0,0,1,0,-1 };
int dx[] = {0, 1,0,-1,0 };
void init() {
 
    scanf("%d %d", &M, &N);
    memset(chk, 0x32, sizeof(chk));
    for (int i = 0; i < N; i++) {
        scanf(" %s", input[i]);
    }
    int c = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            if (input[i][j] == 'C'&&c==0) {
                sy = i;
                sx = j;
                c++;
            }
            else if (input[i][j] == 'C'&&c == 1) {
                ey = i;
                ex = j;
                c++;
            }
        }
    }
}
struct Data {
    int y, x, cnt,dir;
};
void bfs() {
    queue<Data> q;
    q.push({ sy,sx,1,0});
    chk[sy][sx] = 1;
    while (!q.empty()) {
        Data c = q.front(); q.pop();
        for (int dir = 1; dir <= 4; dir++) {
            Data n;
            n.y = c.y + dy[dir];
            n.x = c.x + dx[dir];
            n.dir = c.dir;
            if (dir !=n.dir&&c.dir!=0) {
                n.cnt = c.cnt + 1;
                n.dir = dir;
            }
            else {
                n.cnt = c.cnt;
                n.dir = dir;
            }
            if (0 <= n.y&&n.y < N && 0 <= n.x&&n.x < M) {
                if (chk[n.y][n.x]>=n.cnt && input[n.y][n.x] != '*') {
                    chk[n.y][n.x] = n.cnt;
                    q.push(n);
                }
            }
 
        }
    }
}
void print() {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            printf("%2d", chk[i][j]);
        }
        printf("\n");
    }
}
int main(void) {
    init();
    bfs();
//    print();
    printf("%d", chk[ey][ex]-1);
    return 0;
}