HDU 1195 Open the Lock

BFS题，so easy!

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
const int maxm=10;
int vis[maxm][maxm][maxm][maxm];
int m,n;
struct node
{
    int a[4];
    int step;
}num1,num2;
void bfs()
{
    queue<node>q;
    struct node now,pre;
    pre=num1;
    pre.step=0;
    q.push(pre);
    while(!q.empty())
    {
        pre=q.front();
        q.pop();
        if(pre.a[0]==num2.a[0]&&pre.a[1]==num2.a[1]&&pre.a[2]==num2.a[2]&&pre.a[3]==num2.a[3])
        {
            printf("%d\n",pre.step);
            return;
        }
        for(int i=0;i<4;i++)
        {
            now=pre;
            now.a[i]++;
            if(now.a[i]==10)
            {
                now.a[i]=1;
            }
            if(!vis[now.a[0]][now.a[1]][now.a[2]][now.a[3]])
            {
                vis[now.a[0]][now.a[1]][now.a[2]][now.a[3]]=1;
                now.step++;
                q.push(now);
            }
        }
        for(int i=0;i<4;i++)
        {
            now=pre;
            now.a[i]--;
            if(now.a[i]==0)
            {
                now.a[i]=9;
            }
            if(!vis[now.a[0]][now.a[1]][now.a[2]][now.a[3]])
            {
                vis[now.a[0]][now.a[1]][now.a[2]][now.a[3]]=1;
                now.step++;
                q.push(now);
            }
        }
        for(int i=0;i<3;i++)
        {
            now=pre;
            int temp;
            temp=now.a[i];
            now.a[i]=now.a[i+1];
            now.a[i+1]=temp;
            if(!vis[now.a[0]][now.a[1]][now.a[2]][now.a[3]])
            {
                vis[now.a[0]][now.a[1]][now.a[2]][now.a[3]]=1;
                now.step++;
                q.push(now);
            }
        }
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(vis,0,sizeof(vis));
        scanf("%d%d",&m,&n);
        for(int i=0;i<4;i++)
        {
            num1.a[i]=m%10;
            m/=10;
            num2.a[i]=n%10;
            n/=10;
        }
        bfs();
    }
    return 0;
}