spfa最短路做的,dp更简单。
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=2009;
const int inf=100000000;
int first[maxn],size;
int t,N,X,Y,MAX;
struct Edge
{
int v,d,next;
}edge[maxn*10];
void insert(int u,int v,int d)
{
edge[size].v=v;
edge[size].d=d;
edge[size].next=first[u];
first[u]=size++;
}
struct Line
{
int l,r,h;
}le[maxn];
int cmp(Line le1,Line le2)
{
return le1.h>le2.h;
}
void bulid()
{
sort(le+1,le+N+1,cmp);
for(int i=0;i<=N;i++)
{
int il=1,ir=1,u2=2*i,u1=u2-1;
if(i==0)
{
u1=u1=0;
le[0].l=le[0].r=X;
le[0].h=Y;
}
for(int j=i+1;j<=N+1;j++)
{
int v2=j*2,v1=v2-1;
if(j==N+1)
{
le[j].l=le[i].l;le[j].r=le[i].r;le[j].h=0;
}
int h=le[i].h-le[j].h;
if(h<=MAX)
{
int lla=inf,lra=inf,rla=inf,rra=inf;
int llb=inf,lrb=inf,rlb=inf,rrb=inf;
if(il && le[j].l<=le[i].l && le[j].r>=le[i].l)
{
il=0;
lla=h+le[i].l-le[j].l;
lra=h+le[j].r-le[i].l;
rla=lla+le[i].r-le[i].l;
rra=lra+le[i].r-le[i].l;
}
if(ir && le[j].r>=le[i].r && le[j].l<=le[i].r)
{
ir=0;
rrb=min(rra,h+le[j].r-le[i].r);
rlb=min(rla,h+le[i].r-le[j].l);
lrb=min(lra,rrb+le[i].r-le[i].l);
llb=min(lla,rlb+le[i].r-le[i].l);
}
if(!(il*ir))
{
insert(u1,v1,min(lla,llb));
insert(u1,v2,min(lra,lrb));
insert(u2,v1,min(rla,rlb));
insert(u2,v2,min(rra,rrb));
}
if(il+ir==0) break;
}
}
}
}
int spfa(int s)
{
queue<int> Q;
int dist[maxn],vis[maxn];
memset(vis,0,sizeof(vis));
for(int i=0;i<maxn;i++)
dist[i]=(i==s?0:inf);
Q.push(s); vis[s]=1;
while(!Q.empty())
{
int u=Q.front(); Q.pop();
vis[u]=0;
for(int e=first[u];e!=-1;e=edge[e].next)
{
int v=edge[e].v;
if(edge[e].d+dist[u]<dist[v])
{
dist[v]=edge[e].d+dist[u];
if(!vis[v])
{
Q.push(v);
vis[v]=1;
}
}
}
}
return min(dist[2*N+1],dist[2*N+2]);
}
int main()
{
// freopen("test.txt","r",stdin);
scanf("%d",&t);
while(t--)
{
memset(first,-1,sizeof(first));size=0;
scanf("%d%d%d%d",&N,&X,&Y,&MAX);
for(int i=1;i<=N;i++)
scanf("%d%d%d",&le[i].l,&le[i].r,&le[i].h);
bulid();
printf("%d\n",spfa(0));
}
return 0;
}