http://acm.dlut.edu.cn/problem.php?id=1219
是个二维的最短路,很新鲜啊~用配置好的sublime敲出来的第一个题,也是第一次敲spfa~好开心!
#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1005;
const int INF=0x3f3f3f3f;
struct xx{
int x,y,z,h;
}node[maxn];
struct XX{
int i,s;
};
int dis[maxn][6];
bool inqueue[maxn][6];
int N,C,S;
int Max(int a,int b){
return a>b?a:b;
}
int Max(int a,int b,int c){
return a>Max(b,c)?a:Max(b,c);
}
int Min(int a,int b){
return a<b?a:b;
}
int Min(int a,int b,int c){
return a<Min(b,c)?a:Min(b,c);
}
int ENE(xx a,xx b){
return (a.x-b.x>0?a.x-b.x:b.x-a.x)+(a.y>b.y?a.y-b.y:b.y-a.y)+(a.z>b.z?a.z-b.z:b.z-a.z);
}
int TIM(xx a,xx b){
int A=a.x>b.x?a.x-b.x:b.x-a.x,B=a.y>b.y?a.y-b.y:b.y-a.y,C=a.z>b.z?a.z-b.z:b.z-a.z;
return (Max(A,B,C)+Min(A,B,C)+1)/2;
}
void SPFA(){
memset(dis,INF,sizeof(dis));
memset(inqueue,0,sizeof(inqueue));
queue<XX>q;
q.push((XX){0,S});
dis[0][S]=0;
while(!q.empty()){
int temp=q.front().i,s=q.front().s;
q.pop();
inqueue[temp][s]=0;
for(int i=1;i<=N+1;++i){
if(s>0&&ENE(node[temp],node[i])<=C){
if(node[i].h){
if(dis[temp][s]+TIM(node[temp],node[i])<dis[i][S]){
dis[i][S]=dis[temp][s]+TIM(node[temp],node[i]);
if(!inqueue[i][S]){
inqueue[i][S]=1;
q.push((XX){i,S});
}
}
}
else{
if(dis[temp][s]+TIM(node[temp],node[i])<dis[i][s-1]){
dis[i][s-1]=dis[temp][s]+TIM(node[temp],node[i]);
if(!inqueue[i][s-1]){
inqueue[i][s-1]=1;
q.push((XX){i,s-1});
}
}
}
}
}
}
int m=100000000;
for(int i=1;i<=S;++i){
if(dis[N+1][S]<m)
m=dis[N+1][S];
}
if(m!=INF&&m!=100000000)
printf("%d\n",m);
else printf("-1\n");
}
int main()
{
// freopen("data.in","r",stdin);
int T;
scanf("%d",&T);
while(T--){
int i;
scanf("%d",&N);
memset(node,-1,sizeof(node));
node[0].x=node[0].y=node[0].z=0;
node[0].h=1;
for(i=1;i<=N;++i){
scanf("%d%d%d%d",&node[i].x,&node[i].y,&node[i].z,&node[i].h);
}
scanf("%d%d",&C,&S);
scanf("%d%d%d",&node[N+1].x,&node[N+1].y,&node[N+1].z);
node[N+1].h=1;
SPFA();
}
return 0;
}