题意:飞机在任意位置sx,sy,速度为v,潜艇位置为pa[i].x,p[i].y,速度向量为p[i].vx,p[i].vy,问飞机和这些潜艇相遇并且要一个小时卸载货物,最后回到飞机起点,问至少需要多长时间
思路:n<=8,很小,直接全排列n个潜艇的位置,然后枚举经过所有潜艇所花费的最少时间
刚开始一直出错,初始化错了,注意要每次一个全排列要更新原来坐标的值
代码:
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
#define eps 1e-8
int n;
double sx,sy,v;
struct node
{
double x,y;
double vx,vy;
} a[10],pa[10];
int p[10];
double dis(double x1,double y1,double x2,double y2)
{
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
void solve(int g)
{
double mmin=-1,ans,gx,gy;
do
{
gx=sx;
gy=sy;
ans=0;
for(int i=0;i<n;i++)
a[i]=pa[i];
for(int i=0; i<n; i++)
{
double A,B,aa,bb,cc,t;
A=a[p[i]].x-gx;
B=a[p[i]].y-gy;
aa=a[p[i]].vx*a[p[i]].vx+a[p[i]].vy*a[p[i]].vy-v*v;
bb=2*(A*a[p[i]].vx+B*a[p[i]].vy);
cc=A*A+B*B;
if(fabs(aa)<eps)t=-cc/bb;
else
{
t=(-bb+sqrt(bb*bb-4*aa*cc))/(2*aa);
if(t<0)
t=(-bb-sqrt(bb*bb-4*aa*cc))/(2*aa);
}
t+=1.0;
for(int j=i; j<n; j++)
{
a[p[j]].x+=t*a[p[j]].vx;
a[p[j]].y+=t*a[p[j]].vy;
}
gx=a[p[i]].x;
gy=a[p[i]].y;
ans+=t;
}
ans+=dis(sx,sy,gx,gy)/v;
if(mmin<0 || ans<mmin)
{
mmin=ans;
}
}
while(next_permutation(p,p+n));
int h,m,s;
s=(int)(mmin*3600+0.9999);
m = s/60;
s %= 60;
h = m/60;
m %= 60;
printf("Case %d: %d hour(s) %d minute(s) %d second(s)\n",g,h,m,s);
}
int main()
{
int g=0;
while(scanf("%d",&n),n)
{
g++;
for(int i=0; i<n; i++)
{
scanf("%lf%lf%lf%lf",&pa[i].x,&pa[i].y,&pa[i].vx,&pa[i].vy);
}
scanf("%lf%lf%lf",&sx,&sy,&v);
for(int i=0;i<n;i++)
p[i]=i;
solve(g);
}
return 0;
}