[Luogu1343]地震逃生 最大流

题目链接：https://www.luogu.org/problem/show?pid=1343

dinic跑最大流。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=1<<30;
int inline readint(){
//    int Num;char ch;
//    while((ch=getchar())<'0'||ch>'9');Num=ch-'0';
//    while((ch=getchar())>='0'&&ch<='9') Num=Num*10+ch-'0';
//    return Num;
    int Num;
    scanf("%d",&Num);
    return Num;
}
int N,M,X;
int to[4010],ne[4010],c[4010],fir[210],cnt=0;
void Add(int x,int y,int z){
    to[cnt]=y,ne[cnt]=fir[x],c[cnt]=z,fir[x]=cnt++;
    to[cnt]=x,ne[cnt]=fir[y],c[cnt]=0,fir[y]=cnt++;
}
int S,T;
int bfn[210],ti=0;
int cur[210],q[210],dep[210];
bool Bfs(){
    int head=1,tail=1;
    q[1]=S;
    bfn[S]=++ti;
    dep[S]=0;
    int u;
    while(head<=tail){
        u=q[head++];
        for(int i=fir[u];i!=-1;i=ne[i]){
            int v=to[i];
            if(bfn[v]!=bfn[u]&&c[i]){
                bfn[v]=bfn[u];
                dep[v]=dep[u]+1;
                q[++tail]=v;
            }
        }
    }
    return bfn[T]==bfn[S];
}
int Dfs(int u,int mxf){
    if(!mxf||u==T) return mxf;
    int flow=0,f;
    for(int &i=cur[u];i!=-1;i=ne[i]){
        int v=to[i];
        if(dep[v]==dep[u]+1&&(f=Dfs(v,min(mxf,c[i])))>0){
            c[i]-=f;
            c[i^1]+=f;
            flow+=f;
            mxf-=f;
            if(!mxf) break;
        }
    }
    return flow;
}
int Dinic(){
    int ret=0;
    while(Bfs()){
        memcpy(cur,fir,sizeof(fir));
        ret+=Dfs(S,INF);
    }
    return ret;
}
int main(){
    N=readint();
    M=readint();
    X=readint();
    S=1;
    T=N;
    memset(fir,-1,sizeof(fir));
    for(int i=1;i<=M;i++){
        int a=readint(),
            b=readint(),
            c=readint();
        Add(a,b,c);
    }
    int mx=Dinic();
    if(!mx){
        puts("Orz Ni Jinan Saint Cow!");
        return 0;
    }
    printf("%d %d
",mx,X/mx+(X%mx?1:0));
    return 0;
}