★ POJ 3565 费用流（最短和的匹配一定不相交）

题意：给你n只蚁穴的坐标和n棵苹果树的坐标，让你两两匹配，使得路径不相交，输出一组方案。

分析：这题的WA率真是被我刷上去了。。。思路的话很好理解，但是这题数据不规范啊，题目提示的是整数的输入，但是貌似一定要double，而且两点之间的距离一定要开方，然后判精度，这不是坑人吗。。。

代码：

#pragma comment(linker,"/STACK:102400000,102400000")
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long ll;   //记得必要的时候改成无符号
const double eps=1e-8;
const int maxn=205;
const int maxm=1000005;
const double INF=1000000000000;
struct EdgeNode
{
    int from;
    int to;
    int flow;
    double cost;
    int next;
}edge[maxm];
int head[maxn],cnt;
void add(int x,int y,int z,double c)
{
    edge[cnt].from=x;edge[cnt].to=y;edge[cnt].flow=z;edge[cnt].cost=c;edge[cnt].next=head[x];head[x]=cnt++;
    edge[cnt].from=y;edge[cnt].to=x;edge[cnt].flow=0;edge[cnt].cost=-c;edge[cnt].next=head[y];head[y]=cnt++;
    //printf("%d %d %d %d\n",x,y,z,c);
}

void init()
{
    cnt=0;
    memset(head,-1,sizeof(head));
}
int dcmp(double x)
{
    if(fabs(x)<eps)return 0;
    else return x<0?-1:1;
}
int S,T,n,m;
double d[maxn];
int in[maxn],pre[maxn];
queue<int>Q;
bool spfa(int S,int T)
{
    int u,v,f;
    double c;
    while(!Q.empty())Q.pop();
    memset(in,0,sizeof(in));
    for(int i=0;i<maxn;i++)d[i]=INF;
    d[S]=0;
    Q.push(S);
    while(!Q.empty())
    {
        u=Q.front(); Q.pop(); in[u]=0;
        for(int i=head[u];i!=-1;i=edge[i].next){
            v=edge[i].to; f=edge[i].flow; c=edge[i].cost;
            if(f&&dcmp(d[u]+c-d[v])<0){
                d[v]=d[u]+c; pre[v]=i;
                if(!in[v]){
                    in[v]=1;
                    Q.push(v);
                }
            }
        }
    }
    if(d[T]==INF)return false;
    return true;
}

double MCMF(int S,int T,int need=0)
{
    int u;
    int max_flow=0;
    double min_cost=0;
    while(spfa(S,T))
    {
        int flow=INF;
        u=T;
        while(u!=S){
            flow=min(flow,edge[pre[u]].flow);
            u=edge[pre[u]].from;
        }
        u=T; max_flow+=flow; min_cost+=d[T]*flow;
        while(u!=S){
            edge[pre[u]].flow-=flow;
            edge[pre[u]^1].flow+=flow;
            u=edge[pre[u]].from;
        }
    }
    return min_cost;
}

struct p
{
    double x,y;
}a[105],b[105];
int chu[maxn];
double js(p a,p b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

int main()
{
    int i,x,y,j;
    while(~scanf("%d",&n))
    {
        init(); S=0; T=2*n+1;
        for(i=1;i<=n;i++)scanf("%lf%lf",&a[i].x,&a[i].y);
        for(i=1;i<=n;i++)scanf("%lf%lf",&b[i].x,&b[i].y);
        for(i=1;i<=n;i++)add(S,i,1,0);
        for(i=1;i<=n;i++)add(n+i,T,1,0);
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                add(i,n+j,1,js(a[i],b[j]));
            }
        }
        MCMF(S,T);
        for(i=0;i<cnt;i++){
            x=edge[i].from; y=edge[i].to;
            if(x>0&&x<=n&&y>n&&y<=2*n){
                if(edge[i].flow==0)chu[x]=y-n;
            }
        }
        for(i=1;i<=n;i++)printf("%d\n",chu[i]);
    }
    return 0;
}