1.题目描述:点击打开链接
2.解题思路:本题利用相对运动来解决。首先,我们可以考虑一种简单的情况,甲和乙的路线都是一条线段,因为运动的相对性,可以认为是甲不动,乙自己沿着直线走。因此问题转化为求点到线段的最大和最小距离。
那么如何求解本题呢?其实只需要模拟整个过程即可,假设现在甲的位置在Pa,刚经过编号为Sa的拐点;乙的位置在Pb,刚刚经过编号为Sb的拐点。则我们只需要计算他们两个谁先到达拐点,在这个时间点之前就是刚刚讨论的简化版问题。求解完毕后,需要更新甲乙的位置,如果正好到达下一个拐点,还要更新Sa和Sb。然后继续模拟。因为每次至少有一条狗到达拐点,所以子问题的求解次数不超过A+B。
3.代码:
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<algorithm>
#include<cassert>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<functional>
using namespace std;
#define me(s) memset(s,0,sizeof(s))
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
//typedef pair <int, int> P;
struct Point
{
double x,y;
Point(double x=0,double y=0):x(x),y(y){}
bool operator<(const Point&b)const
{
return x<b.x||(x==b.x&&y<b.y);
}
};
typedef Point Vector;
Vector operator+(Vector A,Vector B)
{
return Vector(A.x+B.x,A.y+B.y);
}
Vector operator-(Vector A,Vector B)
{
return Vector(A.x-B.x,A.y-B.y);
}
Vector operator*(Vector A,double p)
{
return Vector(A.x*p,A.y*p);
}
Vector operator/(Vector A,double p)
{
return Vector(A.x/p,A.y/p);
}
const double eps=1e-10;
int dcmp(double x)
{
if(fabs(x)<eps)return 0;
else return x<0?-1:1;
}
bool operator==(const Point&a,const Point&b)
{
return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0;
}
double Dot(Vector A,Vector B)
{
return A.x*B.x+A.y*B.y;
}
double Length(Vector A)
{
return sqrt(Dot(A,A));
}
double Angle(Vector A,Vector B)
{
return acos(Dot(A,B)/Length(A)/Length(B));
}
double Cross(Vector A,Vector B)
{
return A.x*B.y-A.y*B.x;
}
double Area2(Point A,Point B,Point C)
{
return Cross(B-A,C-A);
}
Vector Rotate(Vector A,double rad)
{
return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));
}
Point GetLineIntersection(Point P,Vector v,Point Q,Vector w)
{
Vector u=P-Q;
double t=Cross(w,u)/Cross(v,w);
return P+v*t;
}
double DistanceToLine(Point P,Point A,Point B)
{
Vector v1=B-A,v2=P-A;
return fabs(Cross(v1,v2))/Length(v1);
}
double DistanceToSegment(Point P,Point A,Point B)
{
Vector v1=B-A,v2=P-A,v3=P-B;
if(A==B)return Length(P-A);
else if(dcmp(Dot(v1,v2))<0) return Length(v2);
else if(dcmp(Dot(v1,v3))>0)return Length(v3);
return fabs(Cross(v1,v2))/Length(v1);
}
Point GetLineProjection(Point P,Point A,Point B)
{
Vector v=B-A;
return A+v*(Dot(v,P-A)/Dot(v,v));
}
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2)
{
double c1=Cross(a2-a1,b1-a1),c2=Cross(a2-a1,b2-a1);
double c3=Cross(b2-b1,a1-b1),c4=Cross(b2-b1,a2-b1);
return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0;
}
bool OnSegment(Point p,Point a1,Point a2)
{
return dcmp(Cross(a1-p,a2-p))==0&&dcmp(Dot(a1-p,a2-p))<0;
}
Point read_point()
{
double x,y;
scanf("%lf%lf",&x,&y);
return Point(x,y) ;
}
/*=======================================================*/
const int N=60;
int T,A,B;
Point P[N],Q[N];
double Min,Max;
void update(Point P,Point A,Point B)
{
Min=min(Min,DistanceToSegment(P,A,B));
Max=max(Max,Length(P-A));
Max=max(Max,Length(P-B));
}
int main()
{
scanf("%d",&T);
for(int kase=1;kase<=T;kase++)
{
scanf("%d%d",&A,&B);
for(int i=0;i<A;i++)P[i]=read_point();
for(int i=0;i<B;i++)Q[i]=read_point();
double LenA=0,LenB=0;
for(int i=0;i<A-1;i++)LenA+=Length(P[i+1]-P[i]);
for(int i=0;i<B-1;i++)LenB+=Length(Q[i+1]-Q[i]);
int Sa=0,Sb=0;
Point Pa=P[0],Pb=Q[0];
Min=1e9,Max=-1e9;
while(Sa<A-1&&Sb<B-1)
{
double La=Length(P[Sa+1]-Pa);//甲到达下一个拐点的距离
double Lb=Length(Q[Sb+1]-Pb);//乙到达下一个拐点的距离
double T=min(La/LenA,Lb/LenB);
Vector Va=(P[Sa+1]-Pa)/La*T*LenA;//取合适的单位,可以让甲乙的速度分别是LenA,LenB,虽然是折线,但是并不影响看做一条直线处理,因此总长也可以表示成速度
Vector Vb=(Q[Sb+1]-Pb)/Lb*T*LenB;//位移向量=单位向量*时间*速度
update(Pa,Pb,Pb+Vb-Va);//求解“简化版”问题,更新最小最大距离
Pa=Pa+Va;
Pb=Pb+Vb;
if(Pa==P[Sa+1])Sa++;//如果达到了新的拐点,更新下标
if(Pb==Q[Sb+1])Sb++;
}
printf("Case %d: %.0lf\n",kase,Max-Min);
}
}