2020 Multi-University Training Contest 3 HDU 6798 Triangle Collision

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6798

题外话：发现即使是程序竞赛的几何题也像是小时候做的那些几何题一样，（当然肯定会难一些）需要你去构造或者说做一些辅助线来进行，这道题目真的让人有些思考（还是我太菜了）对于这种几何题，你可能应该有一些自己学会构造的思想蕴含在其中。这一题真是太典型了，二分+计算几何，确实是好题啊！
题目思路：
构造多个三角形对于当前方向上的路径利用时间进行二分，判断穿过的边的个数

很棒的题！

#define _CRT_SECURE_NO_WARNINGS 1
#pragma GCC optimize(2)
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
#define ls rt<<1
#define rs rt<<1|1
#define pb push_back
#define fi first
#define se second
#define yes puts("YES")
#define no puts("NO")
#define ios ios::sync_with_stdio(0);
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define aint(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
const double eps = 1e-6;
const int N = 1e4+9 ,M = 1e5+12;
const int Maxn=1000010;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
ll qp(ll x,ll y){ll ans=1;x%=mod;while(y){if(y&1)ans=ans*x%mod;x=x*x%mod;y>>=1;}return ans;}
ll inv(ll x){return qp(x,mod-2);}

///head头文件

int _ ;
double l, x, y, vx, vy, k;
double h;
double solve(double y, double vy, double t) {
	return abs(floor((y + vy * t) / h));
}
bool check(double mid) {
	double res = solve(y, vy, mid) +
		solve(fabs((y + sqrt(3) * x - h) / 2), (-sqrt(3) * vx - vy) / 2, mid) +
		solve(fabs((-y + sqrt(3) * x + h) / 2), (vx * sqrt(3) - vy) / 2, mid);
	return res >= k;
}
int main() {
	for(scanf("%d" , &_) ;_ ; _ --){
		scanf("%lf%lf%lf%lf%lf%lf", &l, &x, &y, &vx, &vy, &k);
        h = l * sqrt(3) / 2;
		double l = 0, r = 1e11, mid;
		while (r - l > eps) {
			mid = (l + r) / 2;
			if (check(mid))
				r = mid;
			else
				l = mid;
		}
        printf("%.8f\n", mid);
	}
	return 0;
}

/****
4
4 4
1 2 5 3
1 3 12 0
2 4 2 0
3 4 4 0



***/