题面:
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#define ll long long
using namespace std;
const int maxn=5010;
const int maxm=100010;
int head[maxm],ver[maxm],edge[maxm],cost[maxm],nt[maxm],tot=1;
int d[maxn],incf[maxn],pre[maxn],v[maxn];
int n,m,s,t,maxflow,ans;
int x,y,z,c;
void add(int x,int y,int z,int c)
{
ver[++tot]=y,edge[tot]=z,cost[tot]=c;
nt[tot]=head[x],head[x]=tot;
ver[++tot]=x,edge[tot]=0,cost[tot]=-c;
nt[tot]=head[y],head[y]=tot;
}
bool spfa(void)
{
queue<int>q;
memset(d,0x3f,sizeof(d));
memset(v,0,sizeof(v));
q.push(s);
d[s]=0;
v[s]=1;
incf[s]=1<<30;
while(q.size())
{
int x=q.front();
v[x]=0;
q.pop();
for(int i=head[x];i;i=nt[i])
{
if(!edge[i]) continue;
int y=ver[i];
if(d[y]>d[x]+cost[i])
{
d[y]=d[x]+cost[i];
incf[y]=min(incf[x],edge[i]);
pre[y]=i;
if(!v[y]) v[y]=1,q.push(y);
}
}
}
if(d[t]==0x3f3f3f3f) return false;
return true;
}
void update(void)
{
int x=t;
while(x!=s)
{
int i=pre[x];
edge[i] -= incf[t];
edge[i^1] += incf[t];
x=ver[i^1];
}
maxflow+=incf[t];
ans+=d[t]*incf[t];
}
void get_max(void)
{
maxflow=0;
ans=0;
while(spfa()) update();
}
int main(void)
{
scanf("%d%d%d%d",&n,&m,&s,&t);
for(int i=1;i<=m;i++)
{
scanf("%d%d%d%d",&x,&y,&z,&c);
add(x,y,z,c);
}
get_max();
printf("%d %d\n",maxflow,ans);
return 0;
}