Roadblock

时间限制: 1 Sec  内存限制: 64 MB
提交: 9  解决: 5
[提交][状态][讨论版]

题目描述

Every
morning, FJ wakes up and walks across the farm from his house to the
barn.  The farm is a collection of N fields (1 <= N <= 250)
connected by M bidirectional pathways (1 <= M <= 25,000), each
with an associated length.
FJ's house is in field 1, and the barn is
in field N.  No pair of fields is joined by multiple redundant pathways,
and it is possible to travel between any pair of fields in the farm by
walking along an appropriate sequence of pathways. 
When traveling from one field to another, FJ always selects a route
consisting of a sequence of pathways having minimum total length.

Farmer John's cows, up to no good as
always, have decided to interfere with his morning routine.  They plan
to build a pile of hay bales on exactly one of the M pathways on the
farm, doubling its length.  The cows wish to select
a pathway to block so that they maximize the increase in FJ's distance
from the house to the barn.  Please help the cows determine by how much
they can lengthen FJ's route.

输入

* Line 1: Two space-separated integers, N and M.
* Lines 2..1+M: Line j+1 describes the jth
bidirectional pathway in terms of three space-separated integers: A_j
B_j L_j, where  A_j and B_j are indices in the range 1..N indicating
the  fields joined by the pathway, and L_j is the length of the pathway
(in the range 1...1,000,000).

输出

*
Line 1: The maximum possible increase in the total length of FJ's
shortest route made possible by doubling the length of a  single
pathway.

样例输入

5 7
2 1 5
1 3 1
3 2 8
3 5 7
3 4 3
2 4 7
4 5 2

样例输出

2

提示

There are 5 fields and 7 pathways.  Currently, the shortest path from the house (field 1) to the barn (field 5) is 1-3-4-5 of total length 1+3+2=6.If the cows double the length of the pathway from field 3 to field 4 (increasing its length from 3 to 6), then FJ's shortest route is now 1-3-5, of total length 1+7=8, larger by two than the previous shortest route length.

【分析】农夫要从1走到n,他只走最短路。现在他的牛想使坏,想在一些路上设置障碍,使得这条路的长度变为2倍,求最短路的最大增量(农夫选择的)。先跑一边最段路,找前驱,然后将前驱所练成的每一条边依次遍历将其扩大二倍,再在只把该边扩大二倍的原图上跑最短路,找d[n]的最大值。可能存在很多的最短路,但是只用处理一条,因为即使有两条不相交的最短路,那么跑完之后d[n]还跟第一次跑的一样,不影响。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof a)
#define pb push_back
typedef long long ll;
using namespace std;
const int N = 1e3;
const int M = ;
int n,m,k;
int edgg[N][N];
int edg[N][N],vis[N],d[N],pre[N];
void spfa(int x)
{
met(vis,);
met(d,inf);
d[]=;
vis[]=;
queue<int>q;
q.push();
while(!q.empty()){
int t=q.front();q.pop();
vis[t]=;
for(int i=;i<=n+;i++){
if(d[i]>d[t]+edg[t][i]){
d[i]=d[t]+edg[t][i];
if(!x)pre[i]=t;
if(!vis[i])q.push(i),vis[i]=;
}
}
}
}
int main()
{
met(edg,inf);
met(pre,-);
int ans1,ans2=;
scanf("%d%d",&n,&m);
int u,v,w;
while(m--){
scanf("%d%d%d",&u,&v,&w);
edg[u][v]=edg[v][u]=w;
}
spfa();
ans1=d[n];
for(int i=n;pre[i]!=-;i--){
int v=pre[i];
edg[i][v]*=;
edg[v][i]*=;
spfa();
ans2=max(ans2,d[n]);
edg[i][v]/=;
edg[v][i]/=;
}
printf("%d\n",ans2-ans1);
return ;
}

(寒假集训)Roadblock(最短路)的更多相关文章

  1. CSU-ACM寒假集训选拔-入门题

    CSU-ACM寒假集训选拔-入门题 仅选择部分有价值的题 J(2165): 时间旅行 Description 假设 Bobo 位于时间轴(数轴)上 t0 点,他要使用时间机器回到区间 (0, h] 中 ...

  2. 「BZOJ3694」「FJ2014集训」最短路

    「BZOJ3694」「FJ2014集训」最短路 首先树剖没得说了,这里说一下并查集的做法, 对于一条非树边,它会影响的点就只有u(i),v(i)到lca,对于lca-v的路径上所有点x,都可通过1-t ...

  3. HZNU-ACM寒假集训Day4小结 最短路

    最短路 1.Floy 复杂度O(N3)  适用于任何图(不存在负环) 模板 --kuangbin #include<iostream> #include<cstdio> #in ...

  4. (寒假集训) Piggyback(最短路)

    Piggyback 时间限制: 1 Sec  内存限制: 64 MB提交: 3  解决: 3[提交][状态][讨论版] 题目描述 Bessie and her sister Elsie graze i ...

  5. 中南大学2019年ACM寒假集训前期训练题集(基础题)

    先写一部分,持续到更新完. A: 寒衣调 Description 男从戎,女守家.一夜,狼烟四起,男战死沙场.从此一道黄泉,两地离别.最后,女终于在等待中老去逝去.逝去的最后是换尽一生等到的相逢和团圆 ...

  6. 【寒假集训系列DAY.1】

    Problem A. String Master(master.c/cpp/pas) 题目描述 所谓最长公共子串,比如串 A:“abcde”,串 B:“jcdkl”,则它们的最长公共子串为串 “cd” ...

  7. 2022寒假集训day2

    day1:学习seach和回溯,初步了解. day2:深度优化搜索 T1 洛谷P157:https://www.luogu.com.cn/problem/P1157 题目描述 排列与组合是常用的数学方 ...

  8. GlitchBot -HZNU寒假集训

    One of our delivery robots is malfunctioning! The job of the robot is simple; it should follow a lis ...

  9. Wooden Sticks -HZNU寒假集训

    Wooden Sticks There is a pile of n wooden sticks. The length and weight of each stick are known in a ...

随机推荐

  1. mongodb导入json文件(WINDOWS)

    mongodb导入json格式的文件的命令是mongoimport: 在下面的这个例子中,使用mongoimport命令将文件pi.json中的内容导入loacal数据库的pi集合中. 打开CMD,进 ...

  2. hnust 罚时计算器

    问题 F: 罚时计算器 时间限制: 1 Sec  内存限制: 128 MB提交: 229  解决: 63[提交][状态][讨论版] 题目描述 一般 ACM程序设计比赛都是五个小时.但是比赛结束时,DB ...

  3. Nginx下配置codeigniter框架

    原来在winserver+Apache环境下工作良好的一个微信公众号后台迁移到阿里云(环境:Ubuntu 64位 | PHP5.4 | Nginx1.6)下却频出 404,403,只能访问CI rou ...

  4. css深入理解vertical-align

    第一讲:vertical-align家族基本认识 了解vertical-align支持的属性值以及组成 属性: 1.inherit 2.线类 baseline,top,middle,bottom 3. ...

  5. js万年历

    首先,注意: 1.延迟执行     window.setTimeout(    ,     )     里面的时间是以毫秒计算的 2.间隔执行    window.setInterval(     , ...

  6. 重复造轮子系列--字符串处理(C语言)

    这些字符代码是以前写的,源于很久很久以前的一个VC++项目,在当时的部门编程比赛里因为用了项目代码的xsplit函数,万万没想到,那个做了几年的项目里面居然有坑..xsplit函数居然不能split连 ...

  7. 【CDN】- 什么是CDN

    高冷科普: CDN,Content Delivery Network缩写,即内容分发网络.通过在网络各处放置节点服务器所构成的在现有的互联网基础之上的一层智能虚拟网络,CDN系统能够实时地根据网络流量 ...

  8. 细说php2[正则表达式学习笔记]

    <细说php>这本书应该是每个php程序员入门的必读书籍,里面讲的很多知识都很系统和详细,看了正则这部分,并练习了里面的案例,发现自己已经会了很多.... header('Content- ...

  9. hdu 1534 Schedule Problem (差分约束)

    Schedule Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

  10. bzoj1266 [AHOI2006]上学路线route floyd+最小割

    1266: [AHOI2006]上学路线route Time Limit: 3 Sec  Memory Limit: 162 MBSubmit: 2490  Solved: 898[Submit][S ...