1281 - New Traffic System
Time Limit: 2 second(s) | Memory Limit: 32 MB |
The country - Ajobdesh has a lot of problems in traffic system. As the Govt. is very clever (!), they made a plan to use only one way roads. Two cities s and t are the two most important cities in the country and mostly people travel from s to t. That's why the Govt. made a new plan to introduce some new one way roads in the traffic system such that the time to travel from s to t is reduced.
But since their budget is short, they can't construct more than d roads. So, they want to construct at most d new roads such that it becomes possible to reach t from s in shorter time. Unluckily you are one living in the country and you are assigned this task. That means you will be given the existing roads and the proposed new roads, you have to find the best path from s to t, which may allow at most d newly proposed roads.
Input
Input starts with an integer T (≤ 30), denoting the number of test cases.
Each case starts with a line containing four integers n (2 ≤ n ≤ 10000), m (0 ≤ m ≤ 20000), k (0 ≤ k ≤ 10000), d (0 ≤ d ≤ 10) where n denotes the number of cities, m denotes the number of existing roads and k denotes the number of proposed new roads. The cities are numbered from 0 to n-1 and city 0 is denoted as s and city (n-1) is denoted as t.
Each of the next m lines contains a description of a road, which contains three integers ui vi wi (0 ≤ ui, vi < n, ui ≠ vi, 1 ≤ wi ≤ 1000) meaning that there is a road from ui to vi and it takes wi minutes to travel in the road. There is at most one road from one city to another city.
Each of the next k lines contains a proposed new road with three integers ui vi wi (0 ≤ ui, vi < n, ui ≠ vi 1 ≤ wi ≤ 1000) meaning that the road will be from ui to vi and it will take wi minutes to travel in the road. There can be at most one proposed road from one city to another city.
Output
For each case, print the case number and the shortest path cost from s to t or "Impossible" if there is no path from s to t.
Sample Input |
Output for Sample Input |
2 4 2 2 2 0 1 10 1 3 20 0 2 5 2 3 14 2 0 1 0 0 1 100 |
Case 1: 19 Case 2: Impossible |
Note
Dataset is huge, use faster I/O methods.
思路:最短路;
这个是二维最短路,因为可以添加一些边,而且边数有限制,d[i][j]表示到0点到当前点添加条边的最短路径,用个优先队列维护的dj算法。
1 #include <cstdio>
2 #include <cstdlib>
3 #include <cstring>
4 #include <cmath>
5 #include <iostream>
6 #include <algorithm>
7 #include <map>
8 #include <queue>
9 #include <vector>
10 using namespace std;
11 typedef long long LL;
12 typedef struct pp
13 {
14 int from;
15 int to;
16 int cost;
17 int time;
18 bool operator<(const pp&cx)const
19 {
20 return cx.cost<cost;
21 }
22 } ss;
23 vector<ss>vec[20005];
24 vector<ss>avec[20005];
25 int dis[11][20000];
26 priority_queue<ss>que;
27 bool flag[11][20000];
28 ss mark[20000];
29 void dj(int p);
30 int main(void)
31 {
32 int i,j,k;
33 int __ca=0;
34 scanf("%d",&k);
35 int n,m,s,d;
36 while(k--)
37 {
38 __ca++;
39 scanf("%d %d %d %d",&n,&m,&s,&d);
40 for(i=0; i<20000; i++)
41 {
42 mark[i].time=0;
43 mark[i].cost=1e9;
44 }
45 while(!que.empty())
46 que.pop();
47 for(i=0; i<20005; i++)
48 {
49 vec[i].clear();
50 avec[i].clear();
51 }
52 while(m--)
53 {
54 int x,y,co;
55 scanf("%d %d %d",&x,&y,&co);
56 ss aa;
57 aa.from=x;
58 aa.to=y;
59 aa.cost=co;
60 vec[x].push_back(aa);
61 }
62 for(i=0; i<s; i++)
63 {
64 int x,y,co;
65 scanf("%d %d %d",&x,&y,&co);
66 ss aa;
67 aa.from=x;
68 aa.to=y;
69 aa.cost=co;
70 avec[x].push_back(aa);
71 }
72 memset(flag,0,sizeof(flag));
73 dj(d);
74 int maxx=1e9;
75 for(i=0; i<=d; i++)
76 {
77 if(maxx>dis[i][n-1])
78 maxx=dis[i][n-1];
79 }
80 if(maxx==1e9)
81 {
82 printf("Case %d: Impossible\n",__ca);
83 }
84 else
85 {
86 printf("Case %d: %d\n",__ca,maxx);
87 }
88 }
89 return 0;
90 }
91 void dj(int p)
92 {
93 int i,j;
94 for(i=0; i<11; i++)
95 {
96 for(j=0; j<20000; j++)
97 {
98 dis[i][j]=1e9;
99 }
100 dis[i][0]=0;
101 }
102 dis[0][0]=0;
103 ss ak;
104 ak.to=0;
105 ak.cost=0;
106 ak.time=0;
107 que.push(ak);
108 while(!que.empty())
109 {
110 ss a=que.top();
111 que.pop();
112 int to=a.to;
113 int time=a.time;
114 int co=a.cost;
115 if(dis[time][to]<co||flag[time][to])
116 continue;
117 else
118 {
119 flag[time][to]=true;
120 dis[time][to]=co;
121 for(i=0; i<vec[to].size(); i++)
122 {
123 ss ac=vec[to][i];
124 if(dis[time][ac.to]>co+ac.cost)
125 {
126 dis[time][ac.to]=co+ac.cost;
127 ss dd;
128 dd.to=ac.to;
129 dd.cost=co+ac.cost;
130 dd.time=time;
131 que.push(dd);
132 }
133 }
134 if(time<p)
135 {
136 for(i=0; i<avec[to].size(); i++)
137 {
138 ss ac=avec[to][i];
139 if(dis[time+1][ac.to]>co+ac.cost)
140 {
141 dis[time+1][ac.to]=co+ac.cost;
142 ss dd;
143 dd.to=ac.to;
144 dd.cost=co+ac.cost;
145 dd.time=time+1;
146 que.push(dd);
147 }
148 }
149 }
150 }
151 }
152 }
1281 - New Traffic System的更多相关文章
- Light oj 1281 - New Traffic System 多状态最短路
题目大意:有向图,新计划的地铁,有k个计划新路,利用现有的铁路.k条新路和限定只能用d条新路,找出从0到n-1的最短路径 题目思路:用dist[u][use],储存使用use条新路,到达节点u的最短路 ...
- HDU 4744 Starloop System(最小费用最大流)(2013 ACM/ICPC Asia Regional Hangzhou Online)
Description At the end of the 200013 th year of the Galaxy era, the war between Carbon-based lives a ...
- UVALive 2664 One-way traffic
One-way traffic Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVALive. Or ...
- LightOJ 1291 Real Life Traffic
Real Life Traffic Time Limit: 2000ms Memory Limit: 32768KB This problem will be judged on LightOJ. O ...
- Java实现One-way traffic(单向交通)
One-way traffic In a certain town there are n intersections connected by two- and one-way streets. T ...
- Android软件测试Monkey测试工具
前言: 最近开始研究Android自动化测试方法,对其中的一些工具.方法和框架做了一些简单的整理,其中包括android测试框架.CTS.Monkey.Monkeyrunner.benchmark.其 ...
- Naming Conventions for .NET / C# Projects
http://www.akadia.com/services/naming_conventions.html Naming Conventions for .NET / C# Projects Mar ...
- Java: 基类、子类、构造函数、程序块的初始化顺序
初始化顺序 基类static block 子类static block 基类non-static block 子类non-static block 基类constructor 子类constructo ...
- Big Data Analytics for Security(Big Data Analytics for Security Intelligence)
http://www.infoq.com/articles/bigdata-analytics-for-security This article first appeared in the IEEE ...
随机推荐
- Perl哈希%hash
哈希是 key/value 键/值对的集合. Perl中哈希变量以百分号 (%) 标记开始. 访问哈希元素格式:${key}. 以下是一个简单的哈希实例: 实例 #!/usr/bin/perl %da ...
- hadoop基础题
转自:http://blog.csdn.net/pelick/article/details/8299482 //Hadoop基础 Doug Cutting所创立的项目的名称都受到其家人的启发,以下项 ...
- 日常Java 2021/11/21
Java文档注释 Java支持三种注释方式.前两种分别是Ⅱ和/产*,第三种被称作说明注释,它以产开始,以*I结束.说明注释允许你在程序中嵌入关于程序的信息.你可以使用javadoc工具软件来生成信息, ...
- C语言大小端判定
要判定大小端?需要弄清以下几个问题: 1.当一个变量占多个字节时,变量的指针指向的是低地址 2.什么是大小端? 大端模式:是指数据的高字节保存在内存的低地址中,而数据的低字节保存在内存的高地址中. 小 ...
- Hive(十一)【压缩、存储】
目录 一.Hadoop的压缩配置 1.MR支持的压缩编码 2.压缩参数配置 3.开启Mapper输出阶段压缩 4.开启Reduceer输出阶段 二.文件存储 1.列式存储和行式存储 2.TextFil ...
- 【STM32】使用SDIO进行SD卡读写,包含文件管理FatFs(八)-认识内存管理
[STM32]使用SDIO进行SD卡读写,包含文件管理FatFs(一)-初步认识SD卡 [STM32]使用SDIO进行SD卡读写,包含文件管理FatFs(二)-了解SD总线,命令的相关介绍 [STM3 ...
- 集合类——集合输出、栈和队列及Collections集合
1.集合输出 在之前我们利用了toString()及get()方法对集合进行了输出,其实那都不是集合的标准输出,集合输出有四种方式:Iterator.ListIterator.Enumeration. ...
- SpringMVC注解详情
@Component.@Repository @Service.@Controller 看字面含义,很容易却别出其中三个: @Controller 控制层,就是我们的action层 @Service ...
- 【力扣】123. 买卖股票的最佳时机 III
给定一个数组,它的第 i 个元素是一支给定的股票在第 i 天的价格. 设计一个算法来计算你所能获取的最大利润.你最多可以完成 两笔 交易. 注意:你不能同时参与多笔交易(你必须在再次购买前出售掉之前的 ...
- Log4j 被曝核弹级漏洞,开发者炸锅了!
大家好,我是鱼皮,开门见山,知名的开源项目 Apache Log4j 出事了! 2021 年 12 月 9 日,该项目被曝存在 严重安全漏洞 ,攻击者只需要向目标机传入一段特殊代码,就能触发漏洞,自由 ...