Submission #6738379

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
using namespace std;
const int maxn=50;
int a,b;
int tot,vis[50];
int dir[]={10,5,1,-10,-5,-1};

void dfs(int x,int t)
{
    if (t>tot)return;
    if (x==b)
    {
        //cout << x << endl;
        tot=min(tot,t);
        return;
    }
    for (int i=0;i<6;i++)
    {
        int xx=x+dir[i];
        //cout << xx << " ";
        if (xx>=0&&xx<=40&&vis[xx]!=1)
        {
            vis[xx]=1;
            dfs(xx,t+1);
            vis[xx]=0;
        }
    }
}

int main()
{
    while (cin >> a >> b)
    {
        tot=50;
        memset(vis,0,sizeof vis);
        dfs(a,0);
        cout << tot << endl;
    }
    return 0;
}

Submission Info

Judge Result