【树链剖分】【CF704E】Iron Man

题目

思路

首先链剖，考虑一条重链
于是问题就变成了有若干条线段，求y坐标最小的交点
我们用扫描线维护，同时要维护相邻两条线段的相交时间
如果一条线段插入或删除时已经大于答案，那么直接退出，否则只有相邻信息会改变。

代码

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll x,ll y)
{
	return y==0?x:gcd(y,x%y);
}
ll abs(ll x)
{
	return x<0?-x:x;
}
struct point
{
	ll x,y;
	point() {}
	point(ll _x,ll _y=1ll):x(_x),y(_y)
	{
		ll g=gcd(abs(x),abs(y));
		if(y<0) g=-g;
		x/=g,y/=g;
	}
	friend point operator + (point e,point b) { return point(e.x*b.y+e.y*b.x,e.y*b.y); }
	friend point operator - (point e,point b) { return point(e.x*b.y-e.y*b.x,e.y*b.y); }
	friend point operator * (point e,point b) { return point(e.x*b.x,e.y*b.y); }
	friend point operator / (point e,point b) { return point(e.x*b.y,e.y*b.x); }
	friend bool operator < (point e,point b) { return e.x*b.y<b.x*e.y; }
	friend bool operator > (point e,point b) { return e.x*b.y>b.x*e.y; }
	friend bool operator <= (point e,point b) { return e.x*b.y<=b.x*e.y; }
	friend bool operator >= (point e,point b) { return e.x*b.y>=b.x*e.y; }
	friend bool operator == (point e,point b) { return e.x*b.y==b.x*e.y; }
};

const int N=1e5+7,inf=1e9;
int n,m,d[N],f[N],s[N],son[N],dfn[N],top[N],num;
vi e[N];
double Ans=inf;
point tim,ans;
struct P 
{
	point k,b,l,r;
	P() {}
	P(point k,point b,point l,point r):k(k),b(b),l(l),r(r) {}
	friend bool operator<(P a,P b)
	{
		if(a.k*tim+a.b==b.k*tim+b.b) return a.l==b.l?a.r==b.r?a.k<b.k:a.r<b.r:a.l<b.l;
		return a.k*tim+a.b<b.k*tim+b.b;
	}
};
multiset<P> st;
vector<P> heavy[N],light[N];

int lca(int x,int y)
{
	while(top[x]!=top[y])
	{
		if(d[top[x]]<d[top[y]]) swap(x,y);
		x=f[top[x]];
	}
	return d[x]<d[y]?x:y;
}

point dist(int x,int y)
{
	return point(d[x]+d[y]-2*d[lca(x,y)]);
}

void dfs(int x) 
{
	s[x]=1;
	for(int y:e[x])
		if(y!=f[x])
		{
			f[y]=x,d[y]=d[x]+1,dfs(y),s[x]+=s[y];
			if(s[y]>s[son[x]]) son[x]=y;
		}
}

void dfs(int x,int p)
{
	dfn[x]=++num,top[x]=p;
	if(son[x]) dfs(son[x],p);
	for(int y:e[x])
		if(y!=son[x]&&y!=f[x]) dfs(y,y);
}

void solve(int x,int y,point s,point v) 
{
	point t=s+dist(x,y)/v;
	while(top[x]!=top[y]) if(d[top[x]]>d[top[y]]) 
	{
		int p=top[x];
		heavy[p].pb(P(point(0)-v,point(d[x])+v*s,s,s+point(d[x]-d[p])/v));
		s=s+point(d[x]-d[p])/v,x=top[x],p=f[x];
		light[x].pb(P(point(0)-v,point(d[x])+v*s,s,s+point(d[x]-d[p])/v));
		s=s+point(d[x]-d[p])/v,x=f[x];
	}
	else
	{
		int p=top[y];
		heavy[p].pb(P(v,point(d[y])-v*t,t-point(d[y]-d[p])/v,t));
		t=t-point(d[y]-d[p])/v,y=top[y],p=f[y];
		light[y].pb(P(v,point(d[y])-v*t,t-point(d[y]-d[p])/v,t));
		t=t-point(d[y]-d[p])/v,y=f[y];
	}
	int p=top[x];
	if(d[x]>d[y]) heavy[p].pb(P(point(0)-v,point(d[x])+v*s,s,t));
	else heavy[p].pb(P(v,point(d[y])-v*t,s,t));
}
point get(P a,P b)
{
	if(a.k==b.k) return a.b==b.b?max(a.l,b.l):point(inf);
	point o=(b.b-a.b)/(a.k-b.k);
	return o>=max(a.l,b.l)&&o<=min(a.r,b.r)?o:point(inf);
}
void work(vector<P> p) 
{
	st.clear(),ans=point(inf);
	vector<pair<P,bool>> q;
	for(P x:p) q.pb(mp(x,1)),q.pb(mp(x,0)); 
	sort(q.begin(),q.end(),[](pair<P,bool> x,pair<P,bool> y) 
	{
		point tx=x.se?x.fi.l:x.fi.r,ty=y.se?y.fi.l:y.fi.r;
		return tx==ty?x.se>y.se:tx<ty;
	});
	for(auto x:q)
	{
		point now=x.se?x.fi.l:x.fi.r;
		if(now>=ans) break;
		tim=now;
		if(x.se) 
		{
			auto tmp=st.insert(x.fi),pre=tmp,suf=tmp;
			if(pre!=st.begin()) ans=min(ans,get(*--pre,*tmp));
			if(++suf!=st.end()) ans=min(ans,get(*tmp,*suf));
		}
		else
		{
			auto tmp=st.lower_bound(x.fi),pre=tmp,suf=tmp;
			if(++suf!=st.end()&&pre!=st.begin()) ans=min(ans,get(*--pre,*suf));
			st.erase(tmp);
		}
	}
	Ans=min(Ans,1.0*ans.x/ans.y);
}
int main() 
{
	scanf("%d%d",&n,&m);
	for(int i=1,x,y; i<n; i++) scanf("%d%d",&x,&y),e[x].pb(y),e[y].pb(x);
	d[1]=1,dfs(1),dfs(1,1);
	for(int i=1,t,c,x,y; i<=m; i++) scanf("%d%d%d%d",&t,&c,&x,&y),solve(x,y,point(t),point(c));
	for(int i=1; i<=n; i++) work(heavy[i]),work(light[i]);
	if(Ans==inf)
	{
		printf("-1\n")
		return 0;
	}
	printf("%.10f\n",Ans);
}