bzoj2960: 跨平面

题意：给定平面图，求对偶图的最小树形图。

平面转对偶可以将每条边分成两条，然后暴力找一圈。

最小树形图使用朱刘算法，然而我也不太懂。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#define N 3005
#define M 30005
#define ll long long
using namespace std;
int n,m,st[M],belong[M],cnt,l;
int id[N],fl[N],fa[N],f[N];
bool ok[M];
struct D{int x,y;}a[N];
struct E{int x,y,p;double k;}b[M];
struct cmp{bool operator()(int x,int y){return b[x].k<b[y].k;}};
set<int,cmp>S[N];

ll cross(D a,D b){return (ll)a.x*b.y-(ll)a.y*b.x;}
void link(int x,int y,int z)
{
	b[++l].x=x;b[l].y=y;b[l].p=z;
}
int solve(int n)
{
	int Ans=0,cnt,rt=n;
	while(1)
	{
		for (int i=0;i<=n;i++)f[i]=1000000000;
		for (int i=1;i<=l;i++)
			if (b[i].p<f[b[i].y]&&b[i].x!=b[i].y)
				f[b[i].y]=b[i].p,fa[b[i].y]=b[i].x;
		f[rt]=0;cnt=-1;
		for (int i=0;i<=n;i++) id[i]=fl[i]=-1;
		for (int i=0;i<=n;i++)
		{
			int j;Ans+=f[i];
			for (j=i;j!=rt&&fl[j]!=i&&id[j]==-1;j=fa[j])fl[j]=i;
			if (j!=rt&&id[j]==-1)
			{
				id[j]=++cnt;
				for (int k=fa[j];k!=j;k=fa[k])
					id[k]=cnt;
			}
		}
		if (cnt==-1) break;
		for (int i=0;i<=n;i++)
			if (id[i]==-1) id[i]=++cnt;
		for (int i=1;i<=l;i++)
		{
			int t=f[b[i].y];
			b[i].x=id[b[i].x];
			b[i].y=id[b[i].y];
			if (b[i].x!=b[i].y) b[i].p-=t;
		}
		n=cnt;rt=id[rt];
	}
	return Ans;
}
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
		scanf("%d%d",&a[i].x,&a[i].y);
	for (int i=1;i<=m;i++)
	{
		int t=i<<1;
		scanf("%d%d%d%d",&b[t].x,&b[t].y,&b[t].p,&b[t|1].p);
		b[t|1].x=b[t].y;b[t|1].y=b[t].x;
	}
	m=m*2+1;
	for (int i=2;i<=m;i++)
	{
		b[i].k=-atan2(a[b[i].y].y-a[b[i].x].y,a[b[i].y].x-a[b[i].x].x);
		S[b[i].x].insert(i);
	}
	set<int,cmp>::iterator i1;
	for (int i=2;i<=m;i++)
		if (!ok[i])
		{
			int top=1;ll sum=0;st[1]=i;
			while(1)
			{
				ok[st[top]]=1;
				i1=S[b[st[top]].y].find(st[top]^1);i1++;
				if (i1==S[b[st[top]].y].end())
					i1=S[b[st[top]].y].begin();
				if (*i1==i)break;
				st[++top]=*i1;
			}
			for (int j=1;j<=top;j++)
				sum+=cross(a[b[st[j]].x],a[b[st[j]].y]);
			if (sum>=0)
			{
				cnt++;
				for (int j=1;j<=top;j++) belong[st[j]]=cnt;
			}
		}
	n=cnt+1;int x=1;
	for (int i=2;i<=m;i++)
		if (b[i].p) x+=b[i].p,link(belong[i],belong[i^1],b[i].p);
	for (int i=0;i<n;i++) link(n,i,x);
	printf("%d\n",solve(n)-x);
	return 0;
}