[BFS] POJ 3984

回溯

（这次写的没那么乱七八糟了）

用数组来存每一个节点，并记录父节点的位置

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>

using namespace std;

int map[ 6 ][ 6 ], vis[ 6 ][ 6 ];
int pre[ 120 ];

struct Node {
        int x, y;
        int cnt;
        int indx; //储存在数组里的位置
        int pre;  //储存父亲的位置

} log[ 120 ]; //用数组来储存每个节点

int dirx[ 4 ] = {1, -1, 0, 0};
int diry[ 4 ] = {0, 0, 1, -1};

bool path ( int x, int y ) {
        if ( x >= 0 && x < 5 && y >= 0 && y < 5 && map[ x ][ y ] == 0 )
                return true;
        return false;
}

//递归打印
void Print ( int c ) {
        if ( c == 0 ) {
                printf ( "(0, 0)\n" );
                return;
        }
        Print ( log[ c ].pre );
        printf ( "(%d, %d)\n", log[ c ].x, log[ c ].y );
}

void bfs () {
        memset ( vis, false, sizeof ( vis ) );
        // 0,0为起点
        int tail = 0;
        log[ tail ].x = log[ tail ].y = 0;
        log[ tail ].cnt = 0;
        log[ tail ].indx = tail;
        log[ tail ].pre = 0;
        vis[ 0 ][ 0 ] = true;

        tail++;

        queue<Node> q;
        q.push ( log[ tail ] );

        while ( !q.empty () ) {
                Node cur = q.front ();
                q.pop ();

                if ( cur.x == 4 && cur.y == 4 ) {
                        Print ( cur.indx );
                        return;
                }

                for ( int i = 0; i < 4; ++i ) {
                        Node nex;
                        nex.x = cur.x + dirx[ i ];
                        nex.y = cur.y + diry[ i ];
                        nex.cnt = cur.cnt + 1;

                        if ( !vis[ nex.x ][ nex.y ] && path ( nex.x, nex.y ) ) {
                                vis[ nex.x ][ nex.y ] = true;
                                log[ tail ].x = nex.x;
                                log[ tail ].y = nex.y;
                                log[ tail ].cnt = nex.cnt;
                                log[ tail ].pre = cur.indx;
                                log[ tail ].indx = tail;
                                q.push ( log[ tail ] );
                                ++tail;
                        }
                }
        }
}

int main () {
        for ( int i = 0; i < 5; ++i )
                for ( int j = 0; j < 5; ++j )
                        scanf ( "%d", &map[ i ][ j ] );

        bfs ();

        return 0;
}