大意:1为源点,n为汇点,在图的最短路上,跑网络流
嗯没错我把题解都告诉你了,
所以额写呗!
别忘了!多case清空数组!!!
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define inf 0x3fffffff
using namespace std;
int first[1005],head[1005];
struct data
{
int f,t,w,co,nxt;
}e[10005*2];
int n,m,tot,tol;
int maxflow;
int vis[1005],dis[1005],d[1005],vi[1005],res[1005],pre[1005];
int flow[1005][1005];
struct node
{
int f,t,v,nxt;
}g[10005*2];
void add(int a,int b,int c)
{
e[tot].f=a;
e[tot].t=b;
e[tot].w=1;
e[tot].co=c;
e[tot].nxt=first[a];
first[a]=tot++;
}
void addedge(int a,int b,int c)
{
g[tol].f=a;
g[tol].t=b;
g[tol].v=c;
g[tol].nxt=head[a];
head[a]=tol++;
}
void spfa(int s)
{
queue<int> q;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
dis[i]=0x3fffffff;
}
dis[s]=0;
vis[s]=1;
q.push(s);
while(!q.empty())
{
int t=q.front();
q.pop();
vis[t]=0;
for(int i=first[t];i!=-1;i=e[i].nxt)
{
int v=e[i].t;
if(dis[v]>dis[t]+e[i].w)
{
dis[v]=dis[t]+e[i].w;
if(!vis[v])
{
q.push(v);
vis[v]=1;
}
}
}
}
}
int EK(int s,int e)
{
maxflow=0;
queue<int> q;
memset(flow,0,sizeof(flow));
while(1)
{
memset(res,0,sizeof(res));
res[s]=inf;
q.push(s);
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=head[u];i!=-1;i=g[i].nxt)
{
int t=g[i].t;
if(!res[t] && g[i].v>flow[u][t])
{
pre[t]=u;
q.push(t);
res[t]=min(res[u],g[i].v-flow[u][t]);
}
}
}
//printf("%d\n",res[e]);
if(res[e] == 0)
{
return maxflow;
}
for(int i=e;i!=s;i=pre[i])
{
flow[pre[i]][i]+=res[e];
flow[i][pre[i]]-=res[e];
}
//printf("%d\n",res[e]);
maxflow+=res[e];
}
}
int main()
{
//freopen("barricade.in","r",stdin);
//freopen("barricade.out","w",stdout);
int t;
scanf("%d",&t);
while(t--)
{
tot=0,tol=0;
scanf("%d%d",&n,&m);
//printf("%d %d\n",n,m);
memset(first,-1,sizeof(first));
for(int i=1;i<=m;i++)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
spfa(1);
for(int i=1;i<=n;i++)
{
d[i]=dis[i];
}
spfa(n);
/********重新建图*****/
memset(head,-1,sizeof(head));
for(int u=1;u<=n;u++)
{
for(int i=first[u];i!=-1;i=e[i].nxt)
{
int v=e[i].t;
if(d[u]+dis[v]+1 == d[n])
{
addedge(u,v,e[i].co);
addedge(v,u,0);
}
}
}
int ans=EK(1,n);
printf("%d\n",ans);
}
}
/*
2
4 4
1 2 1
2 4 2
3 1 3
4 3 4
7 6
1 2 8
2 3 5
3 4 9
4 5 3
5 6 2
6 7 10
*/