题目链接:http://61.187.179.132/JudgeOnline/problem.php?id=1193
题意:给出平面上两个位置A和B。每次跳马步就是日字,从A到B最少要多少步?
思路:若AB之间的距离小于等于10则直接爆搜。否则,A每次向B方向移动。这里,若A移动某两个方向后与B的距离相等,不妨设xy方向的距离分别为detX,detY,即detX+detY相等,那么接着比较abs(detX-detY),小的优先。看上去没啥道理。我的理解是比如和为20,那么detX=20,detY=0,就比detX=detY=10差,因为前者要跳20步吧,后者用不了20步。。
#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <map>
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define abs(x) ((x)>=0?(x):-(x))
#define i64 long long
#define u32 unsigned int
#define u64 unsigned long long
#define clr(x,y) memset(x,y,sizeof(x))
#define CLR(x) x.clear()
#define ph(x) push(x)
#define pb(x) push_back(x)
#define Len(x) x.length()
#define SZ(x) x.size()
#define PI acos(-1.0)
#define sqr(x) ((x)*(x))
#define FOR0(i,x) for(i=0;i<x;i++)
#define FOR1(i,x) for(i=1;i<=x;i++)
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define FORL0(i,a) for(i=a;i>=0;i--)
#define FORL1(i,a) for(i=a;i>=1;i--)
#define FORL(i,a,b)for(i=a;i>=b;i--)
#define rush() int C; for(scanf("%d",&C);C--;)
#define Rush(n) while(scanf("%d",&n)!=-1)
using namespace std;
void RD(int &x){scanf("%d",&x);}
void RD(i64 &x){scanf("%lld",&x);}
void RD(u32 &x){scanf("%u",&x);}
void RD(double &x){scanf("%lf",&x);}
void RD(int &x,int &y){scanf("%d%d",&x,&y);}
void RD(u32 &x,u32 &y){scanf("%u%u",&x,&y);}
void RD(double &x,double &y){scanf("%lf%lf",&x,&y);}
void RD(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void RD(u32 &x,u32 &y,u32 &z){scanf("%u%u%u",&x,&y,&z);}
void RD(double &x,double &y,double &z){scanf("%lf%lf%lf",&x,&y,&z);}
void RD(char &x){x=getchar();}
void RD(char *s){scanf("%s",s);}
void RD(string &s){cin>>s;}
void PR(int x) {printf("%d\n",x);}
void PR(i64 x) {printf("%lld\n",x);}
void PR(u32 x) {printf("%u\n",x);}
void PR(double x) {printf("%.4lf\n",x);}
void PR(char x) {printf("%c\n",x);}
void PR(char *x) {printf("%s\n",x);}
void PR(string x) {cout<<x<<endl;}
const int mod=100000007;
const i64 inf=((i64)1)<<40;
const double dinf=1000000000000000000.0;
const int INF=2000000000;
const int HASHSIZE=100007;
const int N=1000005;
struct point
{
int x,y;
point(){}
point(int _x,int _y)
{
x=_x;
y=_y;
}
void get()
{
RD(x,y);
}
point operator+(point a)
{
return point(x+a.x,y+a.y);
}
point operator-(point a)
{
return point(x-a.x,y-a.y);
}
int operator<(const point &a) const
{
if(x!=a.x) return x<a.x;
return y<a.y;
}
};
point a,b;
int dx[]={-2,-2,-1,1,2,2,1,-1};
int dy[]={-1,1,2,2,1,-1,-2,-2};
point dis(point a,point b)
{
int x=abs(a.x-b.x);
int y=abs(a.y-b.y);
return point(x+y,abs(x-y));
}
int BFS(point a)
{
a.x+=100;
a.y+=100;
int d[205][205],i,j;
FOR0(i,200) FOR0(j,200) d[i][j]=INF;
d[100][100]=0;
queue<point> Q;
point u,v;
Q.push(point(100,100));
int ans;
while(!Q.empty())
{
u=Q.front();
Q.pop();
if(u.x==a.x&&u.y==a.y)
{
ans=d[u.x][u.y];
break;
}
FOR0(i,8)
{
v=u+point(dx[i],dy[i]);
if(d[v.x][v.y]>d[u.x][u.y]+1)
{
d[v.x][v.y]=d[u.x][u.y]+1;
Q.push(v);
}
}
}
return ans;
}
int main()
{
a.get(); b.get();
int ans=0;
point c,Min,temp,d;
int i;
while(dis(a,b).x>10)
{
Min=point(INF,INF);
FOR0(i,8)
{
c=a+point(dx[i],dy[i]);
temp=dis(c,b);
if(temp<Min) Min=temp,d=c;
}
a=d; ans++;
}
PR(ans+BFS(a-b));
}