链接:点击打开链接
题意:n个点,m条边,有权无向图,求出删去最少条边数可以使得图没有最短路径,以及最短路上的边最多条最多删除多少使得1还能走到n
代码:
#include <queue>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
const int INF=0x3f3f3f3f;
using namespace std;
struct edge{
int to,cost;
};
typedef pair<int,int> P;
int V;
vector<edge> G[5005];
int d[5005];
void dijkstra(int s){
int i,v;
priority_queue<P,vector<P>,greater<P> >que;
fill(d,d+V+1,INF);
d[s]=0;
que.push(P(0,s));
while(!que.empty()){
P p=que.top(); que.pop();
v=p.second;
if(d[v]<p.first)
continue;
for(i=0;i<G[v].size();i++){
edge e=G[v][i];
if(d[e.to]>d[v]+e.cost){
d[e.to]=d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
} //最短路模板
struct node{
int u,v,cap;
node(){}
node(int u,int v,int cap):u(u),v(v),cap(cap){}
}es[500005];
int R,S,T;
int dis[5005],vis[5005],iter[5005];
vector<int> tab[5005];
void addedge(int u, int v, int cap){
tab[u].push_back(R);
es[R++]=node(u,v,cap);
tab[v].push_back(R);
es[R++]=node(v,u,0);
}
int bfs(){
int i,h;
queue<int> q;
q.push(S);
memset(dis,INF,sizeof(dis));
dis[S]=0;
while(q.size()){
h=q.front();
q.pop();
for(i=0;i<tab[h].size();i++){
node &e=es[tab[h][i]];
if(e.cap>0&&dis[e.v]==INF){
dis[e.v]=dis[h]+1;
q.push(e.v);
}
}
}
return dis[T]<INF;
}
int dfs(int x,int maxflow){
int flow;
if(x==T)
return maxflow;
for(int &i=iter[x];i<tab[x].size();i++){
node &e=es[tab[x][i]];
if(dis[e.v]==dis[x]+1&&e.cap>0){
flow=dfs(e.v,min(maxflow,e.cap));
if(flow){
e.cap-=flow;
es[tab[x][i]^1].cap+=flow;
return flow;
}
}
}
return 0;
}
int dinic(){
int ans,flow;
ans=0;
while(bfs()){
memset(iter,0,sizeof(iter));
while(flow=dfs(S,INF))
ans+=flow;
}
return ans;
} //网络流模板
int main(){
int m,i,j,ans;
int x[60005],y[60005],z[60005];
while(scanf("%d%d",&V,&m)!=EOF){
R=0,S=1,T=V;
for(i=0;i<=V;i++){
G[i].clear();
tab[i].clear();
}
for(i=0;i<m;i++){
scanf("%d%d%d",&x[i],&y[i],&z[i]);
G[x[i]].push_back((edge){y[i],z[i]});
G[y[i]].push_back((edge){x[i],z[i]});
}
dijkstra(1);
for(i=0;i<=V;i++)
G[i].clear();
for(i=0;i<m;i++){
if(d[y[i]]-d[x[i]]==z[i]){ //判断是否是最短路上的边,并且
addedge(x[i],y[i],1); //重新建图跑一遍网络流和最短路
G[x[i]].push_back((edge){y[i],1}); //求出最小割和删边数
G[y[i]].push_back((edge){x[i],1});
}
else if(d[x[i]]-d[y[i]]==z[i]){
addedge(y[i],x[i],1);
G[x[i]].push_back((edge){y[i],1});
G[y[i]].push_back((edge){x[i],1});
}
}
ans=dinic();
dijkstra(1);
printf("%d %d\n",ans,m-d[V]);
}
return 0;
}