题意 : 给你n条线段,问你是否存在一条直线使得所有的线段投影到该直线的时候都会有交点
题解:
所有的线段投影到一条直线是否存在交点,这个问题等价于是否存在一条垂直于某条直线的直线穿过所有的线段,因为直线是任意的,所以垂直于这条直线的直线也是任意的,那么这个问题就转化为了,是否存在一条直线穿过所有的线段。
对于这个问题我们可以发现直线穿过线段的端点一定比穿过线段的中间某个点更优 (端点的时候才是正好使得其可能覆盖的区域最大)这样的话我们就可以暴力所有的端点连成直线看是否能够经过所有的直线就可以了。
注意计算几何常用精度是 1e-8
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 205;
const double eps = 1e-8; // 计算几何精度控制常用 1e-8
struct segment {
double x1,y1,x2,y2;
}segments[maxn];
int n;
double dist (double x1,double y1,double x2,double y2) {
return sqrt ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
double corss (double x1,double y1,double x2,double y2) {
return x1 * y2 - x2 * y1;
}
bool judge (double x1,double y1,double x2,double y2) {
if (dist(x1, y1, x2, y2) < eps) return false;
int flag = 1;
for (int i = 1;i <= n; ++ i) {
if (corss(segments[i].x1 - x1, segments[i].y1 - y1, x2 - x1, y2 - y1) * corss(segments[i].x2 - x1, segments[i].y2 - y1, x2 - x1, y2 - y1) > eps) {
flag = 0;
break;
}
}
if (flag) return true;
return false;
}
int main () {
ios_base :: sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
cin >> n;
int flag = 0;
for (int i = 1;i <= n; ++ i) {
cin >> segments[i].x1 >> segments[i].y1 >> segments[i].x2 >> segments[i].y2;
}
if (n == 1) {
cout << "Yes!" << endl;
continue;
}
else {
for (int i = 1;i <= n; ++ i) {
for (int j = i + 1;j <= n; ++ j) {
if (judge(segments[i].x1,segments[i].y1,segments[j].x1,segments[j].y1) || judge(segments[i].x1,segments[i].y1,segments[j].x2,segments[j].y2) || judge(segments[i].x2,segments[i].y2,segments[j].x1,segments[j].y2) || judge(segments[i].x2,segments[i].y2,segments[j].x2,segments[j].y2)) {
flag = 1;
break;
}
}
}
}
if (flag) cout << "Yes!" << endl;
else cout << "No!" << endl;
}
return 0;
}