[几何] BZOJ 2710 [Violet 1]追风者 POJ 3924 Tornado

好神的几何题
把一个点不动作为参照物然后就变成了只有一个点在动
画出来就是这样

然后就是求一个点到两组平行线段的距离最小值

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef double ld;inline ld sqr(ld x){ return x*x; }
inline int sgn(ld x){if (fabs(x)<1e-8) return 0;return x<0?-1:1;
}struct PP{ld x,y;PP(ld x=0,ld y=0):x(x),y(y) { }bool read() { double _x,_y; if (scanf("%lf%lf",&_x,&_y)==-1) return 0; x=_x; y=_y; return 1; }ld dist() { return sqrt(x*x+y*y); }PP operator - () { return PP(-x,-y); }friend PP operator + (PP A,PP B) { return PP(A.x+B.x,A.y+B.y); }friend PP operator - (PP A,PP B) { return PP(A.x-B.x,A.y-B.y); }friend PP operator * (PP A,ld B) { return PP(A.x*B,A.y*B); }friend PP operator / (PP A,ld B) { return PP(A.x/B,A.y/B); } friend ld operator * (PP A,PP B) { return A.x*B.x+A.y*B.y; }friend ld cross(PP A,PP B) { return A.x*B.y-A.y*B.x; }friend ld dist(PP A,PP B) { return sqrt(sqr(A.x-B.x)+sqr(A.y-B.y)); }
};inline ld calc(PP p,PP A,PP B){if (sgn(A.x-B.x)==0 && sgn(A.y-B.y)==0)return dist(p,A);if (sgn((p-A)*(B-A))>0 && sgn((p-B)*(A-B))>0)return fabs(cross(p-A,B-A))/dist(A,B);return min(dist(A,p),dist(B,p));
}inline ld calc(PP p,PP A,PP B,PP D){int L=0,R=1<<28,m1,m2; ld f1,f2;while (R-L>12){m1=(L+L+R)/3; m2=(L+R+R)/3;f1=calc(p,A+D*m1,B+D*m1);f2=calc(p,A+D*m2,B+D*m2);if (f1<f2)R=m2;elseL=m1;}ld ret=1e20;for (int i=L;i<=R;i++)ret=min(ret,calc(p,A+D*i,B+D*i));return ret;
}ld vw,vt;
PP w0,w1,t0,t1;
ld mind,maxd;inline void Solve(){ld Time=dist(t0,t1)/vt;PP tg=(t1-t0)/dist(t0,t1)*vt;PP wg=(w1-w0)/dist(w0,w1)*vw;PP p1=t0+(tg-wg)*Time;PP p2=p1+(-tg-wg)*Time;ld d1=calc(w0,t0,p1,p2-t0);ld d2=calc(w0,p1,p2,p2-t0);ld d=min(d1,d2);if (sgn(d-maxd)>0)printf("Miss\n");else if (sgn(mind-d)>0)printf("Dangerous\n");elseprintf("Perfect\n");
}int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);while (w0.read()){w1.read(); scanf("%lf",&vw);t0.read(); t1.read(); scanf("%lf",&vt);scanf("%lf%lf",&mind,&maxd);Solve();}return 0;
}

[几何] BZOJ 2710 [Violet 1]追风者 POJ 3924 Tornado相关推荐

BZOJ 2709 Violet 1 迷宫花园
2709: [Violet 1]迷宫花园 Time Limit: 5 Sec Memory Limit: 128 MB Submit: 976 Solved: 340 [Submit][Statu ...
[Luogu P4168] [BZOJ 2724] [Violet]蒲公英
洛谷传送门 BZOJ传送门题目背景亲爱的哥哥: 你在那个城市里面过得好吗? 我在家里面最近很开心呢.昨天晚上奶奶给我讲了那个叫「绝望」的大坏蛋的故事的说!它把人们的房子和田地搞坏,还有好多小朋友也 ...
bzoj 2724[Violet 6]蒲公英
2724: [Violet 6]蒲公英 Time Limit: 40 Sec Memory Limit: 512 MB Submit: 2630 Solved: 920 [Submit][Stat ...
BZOJ 2716: [Violet 3]天使玩偶
2716: [Violet 3]天使玩偶 Time Limit: 80 Sec Memory Limit: 128 MB Submit: 1473 Solved: 621 [Submit][Sta ...
Bzoj 2724: [Violet 6]蒲公英(分块)
2724: [Violet 6]蒲公英 Time Limit: 40 Sec Memory Limit: 512 MB Description Input 修正一下 l = (l_0 + x - 1) ...
bzoj 2724: [Violet 6]蒲公英（分块预处理）
2724: [Violet 6]蒲公英 Time Limit: 40 Sec Memory Limit: 512 MB Submit: 2464 Solved: 848 [Submit][Stat ...
BZOJ 2716 Violet 3 天使玩偶
2716: [Violet 3]天使玩偶 Time Limit: 80 Sec Memory Limit: 128 MB Submit: 2145 Solved: 928 [Submit][Sta ...
BZOJ 2716 [Violet 3]天使玩偶 (CDQ分治、树状数组)
题目链接: https://www.lydsy.com/JudgeOnline/problem.php?id=2716 怎么KD树跑得都那么快啊..我写的CDQ分治被暴虐做四遍CDQ分治,每次求一个 ...
BZOJ 2720 [Violet 5]列队春游 ——期望DP
很喵的一道题(我可不是因为看了YOUSIKI的题解才变成这样的) $ans=\sum_{x<=n}\sum_{i<=n} iP(L=i)$ 其中P(x)表示视线为x的概率. 所以只需要求出 ...

[几何] BZOJ 2710 [Violet 1]追风者 POJ 3924 Tornado

[几何] BZOJ 2710 [Violet 1]追风者 POJ 3924 Tornado相关推荐

最新文章

热门文章