poj3984

j简单题

#include<cstdio>
#include<cstring>
int array[5][5];
int visited[5][5];
struct Point{
    int x, y;
    int pre_num;
};
Point que[100];
int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1};

void print(Point s) {
    if(s.pre_num != -1) {
        print(que[s.pre_num]);
    }
    printf("(%d, %d)\n", s.x, s.y);
}

void BFS() {
    memset(visited, 0, sizeof(visited));
    Point s;
    s.x = 0, s.y = 0;
    visited[0][0] = 1;
    s.pre_num = -1;
    int front = 0, rear = 0;
    que[rear ++] = s;
    while(front < rear) {
        Point hd = que[front];
        front ++;
        if(hd.x == 4 && hd.y == 4) {
            print(hd);
            return;
        }
        for(int i = 0; i < 4; ++ i) {
            int x = hd.x + dir[i][0];
            int y = hd.y + dir[i][1];
            if(x < 0 || x >= 5 || y < 0 || y >= 5) {
                continue;
            }
            if(array[x][y] == 1) {
                continue;
            }
            if(visited[x][y]) {
                continue;
            }
            visited[x][y] = 1;
            Point t;
            t.x = x;
            t.y = y;
            t.pre_num = front - 1;
            que[rear ++] = t;
        }
    }
}
int main() {
    freopen("poj3984.txt", "r", stdin);
    for(int i = 0; i < 5; ++ i) {
        for(int j = 0; j < 5; ++ j) {
            scanf("%d", &array[i][j]);
        }
    }
    BFS();
}