P2153 MCMF

https://www.luogu.org/problemnew/show/P2153

//不能走重复点，就把一个点拆成一个入点和一个出点，容量为1（0），费用都为0，即可保证只走一次
#include <bits/stdc++.h>
using namespace std;

const int maxN=405;
const int maxM=2e4+5;
const int INF=(1<<30);

int N,M;

int head[maxN],tot;
struct Graph
{
    int to,w,cost,next;
}G[maxM*4];
void add(int u,int v,int w,int cost)
{
    G[tot]={v,w,cost,head[u]};
    head[u]=tot++;
}

int pre[maxN],vis[maxN],flow[maxN],dis[maxN],G_id[maxN];
bool spfa(int s,int t)
{
    for(int i=1;i<=maxN;i++)flow[i]=dis[i]=INF;
    dis[s]=0;
    pre[t]=-1;
    queue<int>que;
    que.push(s);
    while(!que.empty())
    {
        int u=que.front();
        que.pop();
        vis[u]=0;
        for(int i=head[u];i+1;i=G[i].next)
        {
            int v=G[i].to;
            if(G[i].w&&dis[v]>dis[u]+G[i].cost)
            {
                dis[v]=dis[u]+G[i].cost;
                pre[v]=u;
                G_id[v]=i;
                flow[v]=min(G[i].w,flow[u]);
                if(!vis[v])
                {
                    vis[v]=1;
                    que.push(v);
                }
            }
        }
    }
    return pre[t]!=-1;
}
void MCMF(int &mincost,int &maxflow)
{
    mincost=maxflow=0;
    int S=1+N,T=N;
    while(spfa(S,T))
    {
        maxflow+=flow[T];
        mincost+=dis[T];
        int idx=T;
        while(idx!=S)
        {
            int id=G_id[idx];
            G[id].w-=flow[T];
            G[id^1].w+=flow[T];
            idx=pre[idx];
        }
    }
}
int main()
{
    cin>>N>>M;
    int u,v,cost;
    memset(head,-1,sizeof(head));
    while(M--)
    {
        scanf("%d%d%d",&u,&v,&cost);
        add(u+N,v,1,cost);
        add(v,u+N,0,-cost);
    }
    for(int i=1;i<=N;i++)
    {
        add(i,i+N,1,0);
        add(i+N,i,0,0);
    }
    int mincost,maxflow;
    MCMF(mincost,maxflow);
    cout<<maxflow<<" "<<mincost;
    return 0;
}