BZOJ1927: [Sdoi2010]星际竞速

每个点到达恰好一次，相当于出度入度都为1
最小费用最大流
源连出度，入度连汇，费用0
源向入度点连边，费用为跳过去的花费
出度点向能到达的入度点连边，费用为走航道的花费
流量都为1

code：

#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
#define inf 1e9
using namespace std;

const int maxn = 11000;
const int maxm = 110000;

struct edge
{
    int y,c,d,nex;
    edge(){}
    edge(int _y,int _c,int _d,int _nex){y=_y;c=_c;d=_d;nex=_nex;}
}a[maxm]; int len,fir[maxn];
int n,m,st,ed;
void ins(int x,int y,int c,int d)
{
    a[++len]=edge(y,c,d,fir[x]); fir[x]=len;
    a[++len]=edge(x,0,-d,fir[y]); fir[y]=len;
}
queue<int>Q;
int pos[maxn],pre[maxn],d[maxn];
bool v[maxn];
bool bfs()
{
    for(int i=1;i<=ed;i++) d[i]=inf; d[st]=0;
    Q.push(st);
    while(!Q.empty())
    {
        int x=Q.front();Q.pop(); v[x]=false;
        for(int k=fir[x];k;k=a[k].nex)
        {
            int y=a[k].y;
            if(a[k].c&&d[y]>d[x]+a[k].d)
            {
                d[y]=d[x]+a[k].d;
                pos[y]=x; pre[y]=k;
                if(!v[y])v[y]=true,Q.push(y);
            }
        }
    }
    return d[ed]!=inf;
}
int minc()
{
    int ret=0;
    while(bfs())
    {
        int minx=inf;
        for(int i=ed;i!=st;i=pos[i]) minx=min(minx,a[pre[i]].c);
        for(int i=ed;i!=st;i=pos[i]) a[pre[i]].c-=minx,a[pre[i]^1].c+=minx;
        ret+=minx*d[ed];
    }
    return ret;
}

int main()
{
    memset(fir,0,sizeof fir); len=1;
    scanf("%d%d",&n,&m); st=2*n+1,ed=st+1;
    for(int i=1;i<=n;i++) ins(st,i,1,0),ins(i+n,ed,1,0);
    for(int i=1;i<=n;i++)
    {
        int x;scanf("%d",&x);
        ins(st,i+n,1,x);
    }
    while(m--)
    {
        int x,y,c;scanf("%d%d%d",&x,&y,&c);
        if(x<y)ins(x,y+n,1,c);
        else ins(y,x+n,1,c);
    }
    printf("%d\n",minc());

    return 0;
}