Mr. Main and Windmills（计算几何，直线交点）

题目描述

链接

Mr. Main took a train from city $s$ to city $t$ and passed a plain full of windmills. The train ran in a straight line. A windmill is a machine used for wind power generation. Its fan blades rotate when the wind blows. From his perspective, colorful windmills lined up on the horizon from left to right.

As the train was running, the order of windmills from his perspective was constantly changing: a windmill was originally on the left/right of another, and then changed to its right/left;

Given the coordinates of the windmills, please find the coordinate of him when he just observed the $h$-th windmill exchanged order with other windmills for the $k$-th times. It is guaranteed that any three of the points given, the cities and the windmills, were not collinear, and that all of the windmills were on the same side of the line that the train ran along.

As shown in the picture, in Mr. Mian’s perspective, B was initially to the left of A, and later to the right of A.

输入描述:

The first line of input contains two integers $n$ and $m$, where $n$ ($1\le n\le 1000$) is number of windmills, and $m$ ($1\le m\le 10^4$) is number of queries.

The second line contains four integers $x_s$ , $y_s$ , $x_t$ and $y_t$ ($-10^6\le x_s,y_s,x_t,y_t\le 10^6$), which are the coordinates of the starting city $s$ and destination city $t$.

The next $n$ lines describe the windmills, the $i$-th of which contains two integers $x_i$,$y_i$ ($-10^6\le x_i,y_i\le 10^6$), which are the coordinates of the $i$-th windmill.

The next $m$ lines describe the queries, the $i$-th of which contains two integers, $h_i$ and $k_i$ ($1\le h_i\le n,1\le k_i\le 10^6$), denoting a query for the coordinates when observing the $k_i$-th pass of the $h_i$-th windmill.

输出描述:

Output $m$ lines, each containing two real numbers $x_i$, $y_i$ , representing the coordinates when the $h_i$-th windmill is observed to exchange order with other windmills for $k$ times; if it does not exist, output $-1$. Your answer is considered correct if its absolute or relative error with the standard answer is less than $10^{-5}$.

输入

4 2
0 0 5 0
1 3
2 4
4 1
4 5
1 2
3 2

输出

-1
4.6666666667 0.0000000000

思路

大致做法为：求出直线与线段的交点，根据交点距离起点的长度排序，然后输出排序后第 $k$ 大的交点的具体位置。

判断直线与线段有没有交点，交点在线段中位置的比例都可以用向量叉乘来做。最后根据交点在线段中的比例也能方便地求出交点的坐标。

值得一提的是，最初我重写 $cmp$，用 $sort$ 排序，结果段错误。惊讶地发现，正是 $sort$ 递归太多而造成堆栈溢出。改用比较稳的归并排序后，就过了。

之后分析了一下，因为我重写 $cmp$ 的时候，定义的是：如果直线与线段没有交点，那么它的优先级是最大的，会排到序列的末尾。这听起来没什么问题，但是，快速排序选择基准元素的时候，如果选到了没有交点的元素，那么，一趟排序下来，只能排一个元素，这种情况下递归深度就没有保证了。

#include<bits/stdc++.h>
using namespace std;
const int N=10100;
int T,n,m,ord[N],h,k,b[N];
double sx,sy,ex,ey,x[N],y[N];

bool cmp(int a,int b){
	double up=(x[b]-x[h])*(sy-y[h])-(sx-x[h])*(y[b]-y[h]);
	double down=(x[b]-x[h])*(ey-y[h])-(ex-x[h])*(y[b]-y[h]);
	if(up*down>=0) return true;
	double u=up/down;
	up=(x[a]-x[h])*(sy-y[h])-(sx-x[h])*(y[a]-y[h]);
	down=(x[a]-x[h])*(ey-y[h])-(ex-x[h])*(y[a]-y[h]);
	if(up*down>=0) return false;
	double v=up/down;
	return u<v;
}

void merge(int l,int r){
	if(r<=l) return;
	int mid=(l+r)>>1,i=l,j=mid+1;
	merge(l,mid); merge(mid+1,r);
	for(int k=l;k<=r;k++)
		if((i<=mid&&cmp(ord[i],ord[j]))||j>r) b[k]=ord[i++];
		else b[k]=ord[j++];
	for(int k=l;k<=r;k++) ord[k]=b[k];
}

void solve(){
	cin>>h>>k;
	if(k>=n) return (void)(cout<<"-1\n");
	//sort(ord+1,ord+n+1,cmp);	//用快排会堆栈溢出
	merge(1,n);
	double up=(x[ord[k]]-x[h])*(sy-y[h])-(sx-x[h])*(y[ord[k]]-y[h]);
	double down=(x[ord[k]]-x[h])*(ey-y[h])-(ex-x[h])*(y[ord[k]]-y[h]);
	if(up*down>=0) return (void)(cout<<"-1\n");
	double p=abs(up)/(abs(down)+abs(up));
	double nx=(ex-sx)*p+sx;
	double ny=(ey-sy)*p+sy;
	cout<<fixed<<setprecision(10)<<nx<<" "<<ny<<"\n";
}

int main(){
	ios::sync_with_stdio(false);
	cin>>n>>m;
	cin>>sx>>sy>>ex>>ey;
	for(int i=1;i<=n;i++) cin>>x[i]>>y[i],ord[i]=i;
	while(m--) solve();
}