题目描述
题目大意:有n个点m条边的图,每一条边一天只能通过一定数量的人,每个人一天只能走一条边,问T个人全部从1走到n所用的最短天数。
题解
首先二分答案k,然后判定k天能不能过去
每个点拆k+1个点,分别表示k+1个时刻,然后对于从第i个时刻到第i+1个时刻连边,连对应的m条边,然后对于每一个时刻的1号点和n号点s->1,n->t,然后判断最大流是否>=T就行了
但是我并没有写二分,而是枚举之后在残余网络上加边直接跑,效率更加优秀
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
#define N 10005
#define E 500005
#define inf 1000000000
int n,m,T,s,t,cnt,maxflow,ans;
int x[N],y[N],z[N];
int tot,point[N],nxt[E],v[E],remain[E];
int deep[N],cur[N],last[N],num[N];
queue <int> q;
void addedge(int x,int y,int cap)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remain[tot]=cap;
++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remain[tot]=0;
}
void bfs(int t)
{
for (int i=1;i<=cnt;++i) deep[i]=cnt,cur[i]=point[i];
deep[t]=0;q.push(t);
while (!q.empty())
{
int now=q.front();q.pop();
for (int i=point[now];i!=-1;i=nxt[i])
if (deep[v[i]]==cnt&&remain[i^1])
{
deep[v[i]]=deep[now]+1;
q.push(v[i]);
}
}
}
int addflow(int s,int t)
{
int now=t,ans=inf;
while (now!=s)
{
ans=min(ans,remain[last[now]]);
now=v[last[now]^1];
}
now=t;
while (now!=s)
{
remain[last[now]]-=ans;
remain[last[now]^1]+=ans;
now=v[last[now]^1];
}
return ans;
}
void isap(int s,int t)
{
bfs(t);
memset(num,0,sizeof(num));
for (int i=1;i<=cnt;++i) ++num[deep[i]];
int now=s;
while (deep[s]<cnt)
{
if (now==t)
{
maxflow+=addflow(s,t);
now=s;
}
bool has_find=0;
for (int i=cur[now];i!=-1;i=nxt[i])
{
cur[now]=i;
if (deep[v[i]]+1==deep[now]&&remain[i])
{
has_find=1;
last[v[i]]=i;
now=v[i];
break;
}
}
if (!has_find)
{
int minn=cnt-1;
for (int i=point[now];i!=-1;i=nxt[i])
if (remain[i]) minn=min(minn,deep[v[i]]);
if (!(--num[deep[now]])) break;
++num[deep[now]=minn+1];
cur[now]=point[now];
if (now!=s) now=v[last[now]^1];
}
}
}
bool check(int k)
{
cnt=2+n*k;
for (int i=1;i<=m;++i)
addedge(2+(k-2)*n+x[i],2+(k-1)*n+y[i],z[i]);
addedge(s,2+(k-1)*n+1,T),addedge(2+k*n,t,T);
isap(s,t);
return maxflow>=T;
}
int main()
{
scanf("%d%d%d",&n,&m,&T);
for (int i=1;i<=m;++i) scanf("%d%d%d",&x[i],&y[i],&z[i]);
tot=-1;memset(point,-1,sizeof(point));
s=1,t=2;
addedge(s,3,T),addedge(2+n,t,T);
for (int i=2;i<=n+T;++i)
if (check(i)) {ans=i-1;break;}
printf("%d\n",ans);
}