P2153 [SDOI2009]晨跑 最小费用最大流

P2153 [SDOI2009]晨跑 最小费用最大流

题目：https://www.luogu.com.cn/problem/P2153

分析：由于每个顶点只能经过一次，所以将每一个顶点拆成两个顶点，中间连容量为1的边。由于1和n分别是起点和终点，连两个超级源点即可

建图：左数字为容量，右数字为费用

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=4e2+7;
const int INF=1e9;
const ll INFF=1e18;
struct node
{
    int to,next,cap,flow,cost;
}edge[maxn*maxn];
int head[maxn],tol,n,m,u,v,w,cost=0;
int pre[maxn],dis[maxn];
bool vis[maxn];
void init()
{
    tol=0;
    mem(head,-1);
}
void add(int u,int v,int cap,int cost)
{
    edge[tol].to=v;
    edge[tol].cap=cap;
    edge[tol].cost=cost;
    edge[tol].flow=0;
    edge[tol].next=head[u];
    head[u]=tol++;
    edge[tol].to=u;
    edge[tol].cap=0;
    edge[tol].cost=-cost;
    edge[tol].flow=0;
    edge[tol].next=head[v];
    head[v]=tol++;
}
bool spfa(int sx,int ex)
{
    queue<int> q;
    rep(i,0,2*n+1)
    {
        dis[i]=INF;
        vis[i]=false;
        pre[i]=-1;
    }
    dis[sx]=0;
    vis[sx]=true;
    q.push(sx);
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        vis[u]=false;
        for (int i=head[u];i!=-1;i=edge[i].next)
        {
            int v=edge[i].to;
            if (edge[i].cap>edge[i].flow&&dis[v]>dis[u]+edge[i].cost)
            {
                dis[v]=dis[u]+edge[i].cost;
                pre[v]=i;
                if (!vis[v])
                {
                    vis[v]=true;
                    q.push(v);
                }
            }
        }
    }
    if (pre[ex]==-1)return false;
    else return true;
}
int solve(int sx,int ex,int &cost)
{
    int flow=0;
    cost=0;
    while(spfa(sx,ex))
    {
        int minn=INF;
        for (int i=pre[ex];i!=-1;i=pre[edge[i^1].to])
        {
            minn=min(minn,edge[i].cap-edge[i].flow);
        }
        for (int i=pre[ex];i!=-1;i=pre[edge[i^1].to])
        {
            edge[i].flow+=minn;
            edge[i^1].flow-=minn;
            cost+=edge[i].cost*minn;
        }
        flow+=minn;
    }
    return flow;
}
int main()
{
    init();
    scanf("%d%d",&n,&m);
    rep(i,1,m)
    {
        scanf("%d%d%d",&u,&v,&w);
        add(u,v+n,1,w);
    }
    rep(i,1,n)add(i+n,i,1,0);
    add(0,1,INF,0);
    add(2*n,2*n+1,INF,0);
    int x=solve(0,2*n+1,cost);
    printf("%d %d\n",x,cost);
    return 0;
}