[kuangbin带你飞]专题一 简单搜索

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
struct node
{
    int x;
    int y;
    int s;
};
int g[10][10];
int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int main()
{
//    freopen("in.in","r",stdin);
    node s, t;
    string l;
    queue<node>q;
    vector<node>v;
    
    for(int i = 0; i <= 6; i++)
        for(int j = 0; j <= 6; j++)
            g[i][j] = 1;    
            
    for(int i = 1; i <= 5; i++)
        for(int j = 1; j <= 5; j++)
            scanf("%d",&g[i][j]);        

    s.x = 1;
    s.y = 1;
    s.s = -1;
    q.push(s);
    while(q.size())
    {
        s = q.front();
        q.pop();
        g[s.x][s.y] = s.s;
        if(s.x == 5 && s.y == 5)    break;
        
        for(int i = 0; i < 4; i++)
        {
            t.x = s.x + d[i][0];
            t.y = s.y + d[i][1];
            t.s = s.s - 1;
            if(g[t.x][t.y] == 0)
                q.push(t);

        }
    }
    while(q.size())    q.pop();
    s.x = 5;
    s.y = 5;
    q.push(s);
    while(q.size())
    {
        s = q.front();
        q.pop();
        if(s.x == 1 && s.y == 1)    break;
        for(int i = 0; i < 4; i++)
        {
            t.x = s.x + d[i][0];
            t.y = s.y + d[i][1];
            if(g[t.x][t.y] == g[s.x][s.y] + 1)
            {
                q.push(t);
                v.push_back(t);
                break;
            }
        }
    }
    for(int i = v.size() - 1; i >= 0; i--)
        printf("(%d, %d)
",v[i].x-1,v[i].y-1);
    printf("(4, 4)
");
    return 0;
}