BZOJ2395: [Balkan 2011]Timeismoney【最小乘积生成树】

2395: [Balkan 2011]Timeismoney

这篇博客写的不错https://www.cnblogs.com/autsky-jadek/p/3959446.html

每次求出距离最远的点然后分治就可以了。

#include<cstdio>
#include<algorithm>
const int MAXN=205,MAXE=10005;
int n,m,fa[MAXN];
struct Edge{
	int x,y,w,s,t;
	bool operator <(const Edge b)const{return w<b.w;}
}E[MAXE];
struct Point{
	int x,y;
	int operator *(const Point b)const{return x*b.y-y*b.x;}
	Point operator -(const Point b)const{return (Point){x-b.x,y-b.y};}
}Ans,A,B;
#include<cctype>
int read(){
	int ret=0;char ch=getchar();bool f=1;
	for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');
	for(; isdigit(ch);ch=getchar()) ret=ret*10+ch-48;
	return f?ret:-ret;
}
int get(int x){return x==fa[x]?x:fa[x]=get(fa[x]);}
Point Kruskal(){
	for(int i=1;i<=n;i++) fa[i]=i; 
	std::sort(E+1,E+1+m);
	Point ret=(Point){0,0};
	for(int i=1;i<=m;i++){
		int x=get(E[i].x),y=get(E[i].y);
		if(x==y) continue;
		fa[y]=x;ret.x+=E[i].s,ret.y+=E[i].t;
	}
	if(ret.x*ret.y<Ans.x*Ans.y||(ret.x*ret.y==Ans.x*Ans.y&&ret.x<Ans.x)) Ans=ret;
	return ret;
}
void Work(Point A,Point B){
	for(int i=1;i<=m;i++) E[i].w=E[i].t*(B.x-A.x)+E[i].s*(A.y-B.y);
	Point C=Kruskal();
	if((B-A)*(C-A)>=0) return;
	Work(A,C),Work(C,B);
}
int main(){
//	freopen("2395.in","r",stdin);
//	freopen("2395.out","w",stdout);
	n=read(),m=read();Ans=(Point){2e9,1};
	for(int i=1;i<=m;i++) E[i]=(Edge){read()+1,read()+1,0,read(),read()};
	for(int i=1;i<=m;i++) E[i].w=E[i].s;A=Kruskal();
	for(int i=1;i<=m;i++) E[i].w=E[i].t;B=Kruskal();
	Work(A,B);
	printf("%d %d\n",Ans.x,Ans.y);
	return 0;
}