[USACO4.4]追查坏牛奶Pollutant Control

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
inline int read(){
    char ch=getchar();int sum=0;
    while(ch<'0'||ch>'9') ch=getchar();
    while(ch>='0'&&ch<='9')
        sum*=10,sum+=ch-'0',ch=getchar();
    return sum;
}
#if 0
Writers: G.S.M. && Goes
#endif
const int N=1001000;
const long long A=1001;
const long long INF=(1<<30);
#define ll long long
struct ss{
    ll to,nex;ll cap;
}edge[N<<1];int head[N],ecnt=1;
void add(ll cap,int y,int x){
    edge[++ecnt]=(ss){y,head[x],cap*A+1};
    edge[++ecnt]=(ss){x,head[y],0};
    head[x]=ecnt-1;head[y]=ecnt;
}
#include<queue>
int level[N],n;
bool bfs(){
    memset(level,0,sizeof(level));
    queue<int>Q;Q.push(1);level[1]=1;
    while(!Q.empty()){
        int pos=Q.front();Q.pop();
        for(int i=head[pos];i;i=edge[i].nex)
        if(edge[i].cap&&!level[edge[i].to]){
            level[edge[i].to]=level[pos]+1;
            Q.push(edge[i].to);
        }if(level[n])return true;
    }return level[n];
}
ll dfs(int pos,ll flow){
    if(pos==n||!flow)return flow;int res=0;
    for(int i=head[pos];i;i=edge[i].nex)
    if(edge[i].cap&&level[edge[i].to]==level[pos]+1){
        int tmp=dfs(edge[i].to,min(flow,edge[i].cap));
        edge[i].cap-=tmp;edge[i^1].cap+=tmp;
        flow-=tmp;res+=tmp;if(!flow)return res;
    }return res;
}
ll Dinic(){ll res=0;while(bfs())
    res+=dfs(1,INF);return res;}

int main()
{
    n=read();int m=read();
    while(m--)add(read(),read(),(ll)read());
    ll s=Dinic();printf("%lld %lld",s/A,s%A);
}