题目概述
有一个
n
个点,
1.
2.
解题报告
我们会发现
那么我们就要在
ps:心机出题人竟然出
m=0
的数据,成功卡死了我QAQ,因为
m=0
会让情况2必定验证成功,导致答案出错(
m=0
时显然代价为0)。
示例程序
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn=500,maxm=10000+maxn,MAXINT=((1<<30)-1)*2+1;
int te,n,m,S,T,SS,TT,P,num[maxn+5],ful,fst;
struct data {int x,y,z;}a[maxm+5];
int E,lnk[maxn+5],cur[maxn+5],dis[maxn+5],que[maxn+5];bool vis[maxn+5];
struct Edge
{
int cap,flow,nxt,son;Edge() {}
Edge(int a,int b,int c,int d) {cap=a;flow=b;nxt=c;son=d;}
};
Edge e[2*maxm+5];
bool Bfs(int st,int gl)
{
memset(vis,0,sizeof(vis));
int Head=0,Tail=0;que[++Tail]=st;vis[st]=true;dis[st]=0;
while (Head!=Tail)
{
int x=que[++Head];
for (int j=lnk[x];~j;j=e[j].nxt)
if (e[j].cap>e[j].flow&&!vis[e[j].son])
{
que[++Tail]=e[j].son;vis[e[j].son]=true;
dis[e[j].son]=dis[x]+1;
}
}
return vis[gl];
}
int Dfs(int x,int gl,int MIN=MAXINT)
{
if (!MIN||x==gl) return MIN;
int flow=0,f;
for (int &j=cur[x];~j;j=e[j].nxt)
if (dis[x]+1==dis[e[j].son]&&(f=Dfs(e[j].son,gl,min(MIN,e[j].cap-e[j].flow))))
{
e[j].flow+=f;e[j^1].flow-=f;
flow+=f;MIN-=f;if (!MIN) break;
}
return flow;
}
int Dinic(int st,int gl)
{
int MAX=0;
while (Bfs(st,gl))
{
memcpy(cur,lnk,sizeof(lnk));
MAX+=Dfs(st,gl);
}
return MAX;
}
void Add(int x,int y,int L,int R)
{
e[E]=Edge(R-L,0,lnk[x],y);lnk[x]=E++;
e[E]=Edge(0,0,lnk[y],x);lnk[y]=E++;
num[x]-=L;num[y]+=L;
}
bool check(int L,int R)
{
E=0;memset(lnk,255,sizeof(lnk));memset(num,0,sizeof(num));ful=0;
for (int i=1;i<=m;i++) Add(a[i].x,a[i].y,L,min(a[i].z,R));
for (int i=0;i<n;i++)
if (num[i]>0) Add(SS,i,0,num[i]),ful+=num[i]; else
if (num[i]<0) Add(i,TT,0,-num[i]);
Add(T,S,0,MAXINT);
if (Dinic(SS,TT)<ful) return false;
int lst=e[E-2].flow;
for (int j=lnk[SS];~j;j=e[j].nxt) e[j].flow=e[j].cap,e[j^1].flow=e[j^1].cap;
for (int j=lnk[TT];~j;j=e[j].nxt) e[j].flow=e[j].cap,e[j^1].flow=e[j^1].cap;
e[E-2].flow=e[E-2].cap;e[E-1].flow=e[E-1].cap;
return lst+Dinic(S,T)==fst;
}
LL Solve1()
{
int L=0,R=0;for (int i=1;i<=m;i++) R=max(R,a[i].z);
while (L<=R)
{
int mid=L+(R-L>>1);
if (check(0,mid)) R=mid-1; else L=mid+1;
}
return (LL)L*P;
}
LL Solve2()
{
if (!m) return 0;
int L=0,R=MAXINT;for (int i=1;i<=m;i++) R=min(R,a[i].z);
while (L<=R)
{
int mid=L+(R-L>>1);
if (check(mid,MAXINT)) L=mid+1; else R=mid-1;
}
return (LL)R*P;
}
int main()
{
freopen("program.in","r",stdin);
freopen("program.out","w",stdout);
for (scanf("%d",&te);te;te--)
{
E=0;memset(lnk,255,sizeof(lnk));
scanf("%d%d%d%d%d",&n,&m,&S,&T,&P);SS=n;TT=SS+1;
for (int i=1;i<=m;i++)
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z),Add(a[i].x,a[i].y,0,a[i].z);
fst=Dinic(S,T);
printf("%lld %lld\n",Solve1(),Solve2());
}
return 0;
}