[BZOJ2395][最小乘积生成树] Balkan 2011：Timeismoney

BZOJ2395

首先求出两个权值分别对应的最小生成树
然后考虑把两个权值看作两维坐标
那么我们要找到下凸壳上的点来维护答案，就是先找离最初两个点最远的一个点，然后从这个点递归向两边找
怎么找这个点？通过向量来找，每次更新权值
下凸壳的点数期望log

Code：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=205,INF=1e8;
struct E{int x,y,z,c,t;}e[10005];
inline bool operator < (E a,E b){return a.z<b.z;}
int fa[N];
inline int get(int x){return x==fa[x]?x:fa[x]=get(fa[x]);}
struct point{
	int x,y;
	point(){}
	point(int _x,int _y):x(_x),y(_y){}
	friend inline point operator - (const point &a,const point &b){return point(a.x-b.x,a.y-b.y);}
	friend inline int operator * (const point &a,const point &b){return a.x*b.y-a.y*b.x;}
};
int n,m;
point mnc,mnt,ans=point(INF,INF);
inline point kruscal(){
	sort(e+1,e+m+1);
	int tot=0;
	point now=point(0,0);
	for(int i=1;i<=n;i++) fa[i]=i;
	sort(e+1,e+m+1);
	for(int i=1;i<=m;i++){
		int xx=get(e[i].x),yy=get(e[i].y);
		if(xx==yy) continue;
		fa[xx]=yy;++tot;
		now.x+=e[i].c,now.y+=e[i].t;
		if(tot==n-1) break;
	}
	ll fans=ans.x*ans.y,fnow=now.x*now.y;
	if(fans>fnow || (fans==fnow && now.x<ans.x)) ans=now;
	return now;
}
void solve(point a,point b){
	for(int i=1;i<=m;i++) e[i].z=e[i].t*(b.x-a.x)+e[i].c*(a.y-b.y);
	point c=kruscal();
	if((b-a)*(c-a)>=0) return;
	solve(a,c);solve(c,b);
}
int main(){
	n=read();m=read();
	for(int i=1;i<=m;i++){e[i].x=read()+1,e[i].y=read()+1;e[i].c=read();e[i].t=read();}
	for(int i=1;i<=m;i++) e[i].z=e[i].c;mnc=kruscal();
	for(int i=1;i<=m;i++) e[i].z=e[i].t;mnt=kruscal();
	solve(mnc,mnt);
	cout<<ans.x<<" "<<ans.y;
	return 0;
}