题目链接
题目大意
有一矩阵,一个人要从(0,5)走到(10,5),中间有很多的墙,墙是不能走的,问从起点到终点的最短路是多少
解题思路
本来想着是dfs搜索的,搜了半天,那个相交的地方不知道怎么处理
都来发现是 ,点和点之间连线,如果没有和任何墙相交,就可以到达,然后建图跑最短路
题是不难,就是思路还挺巧妙的
顺便存一下线段交的板子
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
const int N=1e5+5;
double inf=100000000.0;
double eps=1e-8;
struct node
{
double x,y;
node(){}
node(double X,double Y)
{
x=X;
y=Y;
}
int operator == (const node &a)
{
return a.x==x&&a.y==y;
}
node operator - (const node &a)
{
return node(x-a.x,y-a.y);
}
};
node e[N];
struct line
{
node x,y;
line() {}
line(node X,node Y)
{
x=X;
y=Y;
}
};
line l[N];
int n;
double dis[1005][1005];
double diss(node a,node b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double cross(node a,node b)
{
return (a.x*b.y)-(a.y*b.x);
}
int sgn(double x)
{
if(fabs(x) < eps)return 0;
if(x < 0) return -1;
else return 1;
}
double multi(node p1,node p2,node p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int FF(line a,line b)
{
if(a.x==b.x||a.x==b.y||a.y==b.x||a.y==b.y)//判断端点重合
return 0;
return
max(a.x.x,a.y.x) >= min(b.x.x,b.y.x) &&
max(b.x.x,b.y.x) >= min(a.x.x,a.y.x) &&
max(a.x.y,a.y.y) >= min(b.x.y,b.y.y) &&
max(b.x.y,b.y.y) >= min(a.x.y,a.y.y) &&
sgn(cross((b.x-a.x),(a.y-a.x)))*sgn(cross((b.y-a.x),(a.y-a.x))) <= 0 &&
sgn(cross((a.x-b.x),(b.y-b.x)))*sgn(cross((a.y-b.x),(b.y-b.x))) <= 0;
return 0;
}
int F(node a,node b,int cnt)
{
for(int i=1; i<=cnt; i++)
{
// printf("%f %f %f %f %d %d\n",a.x,a.y,b.x,b.y,i,FF(line(a,b),l[i]));
if(FF(line(a,b),l[i]))
return 0;
}
return 1;
}
int main()
{
while(~scanf("%d",&n))
{
double x1,y1,y2,y3,y4;
if(n==-1)
break;
int cnt=0,num=0;
for(int i=1; i<=n; i++)
{
scanf("%lf %lf %lf %lf %lf",&x1,&y1,&y2,&y3,&y4);
//e[++num]=node(x1,0);
e[++num]=node(x1,y1);
l[++cnt]=line(node(x1,0),node(x1,y1));
e[++num]=node(x1,y2);
e[++num]=node(x1,y3);
l[++cnt]=line(node(x1,y2),node(x1,y3));
e[++num]=node(x1,y4);
// e[++num]=node(x1,10);
l[++cnt]=line(node(x1,y4),node(x1,10));
}
e[0]=node(0,5);
e[++num]=node(10,5);;
for(int i=0; i<=num; i++)
{
for(int j=0; j<=num; j++)
{
if(i==j)
dis[i][j]=0;
else
dis[i][j]=inf;
}
}
for(int i=0; i<=num; i++)
{
for(int j=i+1; j<=num; j++)
{
if(fabs(e[i].x-e[j].x)<eps)
continue;
if(F(e[i],e[j],cnt))
{
//printf("%d %d %f\n",i,j,diss(e[i],e[j]));
dis[i][j]=dis[j][i]=diss(e[i],e[j]);
}
}
}
for(int k=0;k<=num;k++)
{
for(int i=0;i<=num;i++)
{
for(int j=0;j<=num;j++)
{
if(dis[i][j]>dis[i][k]+dis[k][j])
dis[i][j]=dis[i][k]+dis[k][j];
}
}
}
printf("%.2f\n",dis[0][num]);
}
return 0;
}