codevs 1021
题目大意:有N个城市,M条道路,每条道路需T分钟通过,其中有一条道路正在维修,无法通车,但不知道是哪一条,求从1号城市到n号城市的最长时间。
思路:先跑一遍最长路(记录下每条边:可通过fa[]),在依次删去最长路上的边,再跑最长路。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int maxn = 1000 + 5;
int k = 1,flag = 1,head[maxn],vis[maxn],dis[maxn],fa[maxn*maxn],del[maxn * maxn],n,m,ans;
struct edge
{
int u,v,w,next;
}e[maxn * maxn];
void adds(int u,int v,int w)
{
e[k].u = u;
e[k].v = v;
e[k].w = w;
e[k].next = head[u];
head[u] = k++;
}
queue<int> q;
void spfa()
{
memset(dis,0x3f3f3f3f,sizeof(dis));
q.push(1);
dis[1] = 0;
vis[1] = 1;
while(!q.empty())
{
int u = q.front();
q.pop();vis[u] = 0;
for(int i = head[u]; i != -1; i = e[i].next)
{
int v = e[i].v;
if(dis[v] > dis[u] + e[i].w && !del[i])
{
dis[v] = dis[u] + e[i].w;
if(flag) fa[v] = i;
if(!vis[v])
{
q.push(v);
vis[v] = 1;
//printf("%d %d %d\n",u,v,dis[v]);
}
}
}
}
//printf("%d\n",dis[n]);
ans = max(ans,dis[n]);
}
int main()
{
int u,v,w;
scanf("%d%d",&n,&m);
memset(head,-1,sizeof(head));
for(int i = 1;i <= m; ++i)
{
scanf("%d%d%d",&u,&v,&w);
adds(u,v,w); adds(v,u,w);
}
spfa();
flag = 0;
for(int i = fa[n]; i != 0; i = fa[e[i].u])
{
del[i] = 1;
if(i % 2)del[i - 1] = 1;
else del[i + 1] = 1;
spfa();
del[i] = 0;
if(i % 2) del[i - 1] = 0;
del[i + 1] = 0;
}
printf("%d",ans);
return 0;
}