cf 602 C(最短路)
2015-11-25 19:25
330 查看
C. The Two Routes
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
In Absurdistan, there are n towns (numbered 1 through n)
and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y,
there is a bidirectional road between towns x and y if
and only if there is no railway between them. Travelling to a different town using one railway or one road always takes exactly one hour.
A train and a bus leave town 1 at the same time. They both have the same destination, town n,
and don't make any stops on the way (but they can wait in town n). The train can move only along railways and the bus can move only
along roads.
You've been asked to plan out routes for the vehicles; each route can use any road/railway multiple times. One of the most important aspects to consider is safety — in order to avoid accidents at railway crossings, the train and the bus must not arrive at the
same town (except town n) simultaneously.
Under these constraints, what is the minimum number of hours needed for both vehicles to reach town n (the maximum of arrival times
of the bus and the train)? Note, that bus and train are not required to arrive to the town n at the same moment of time, but are allowed
to do so.
Input
The first line of the input contains two integers n and m (2 ≤ n ≤ 400, 0 ≤ m ≤ n(n - 1) / 2) —
the number of towns and the number of railways respectively.
Each of the next m lines contains two integers u and v,
denoting a railway between towns u and v (1 ≤ u, v ≤ n, u ≠ v).
You may assume that there is at most one railway connecting any two towns.
Output
Output one integer — the smallest possible time of the later vehicle's arrival in town n. If it's impossible for at least one of the
vehicles to reach town n, output - 1.
Sample test(s)
input
output
input
output
input
output
Note
In the first sample, the train can take the route
and
the bus can take the route
.
Note that they can arrive at town 4 at the same time.
In the second sample, Absurdistan is ruled by railwaymen. There are no roads, so there's no way for the bus to reach town 4.
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
In Absurdistan, there are n towns (numbered 1 through n)
and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y,
there is a bidirectional road between towns x and y if
and only if there is no railway between them. Travelling to a different town using one railway or one road always takes exactly one hour.
A train and a bus leave town 1 at the same time. They both have the same destination, town n,
and don't make any stops on the way (but they can wait in town n). The train can move only along railways and the bus can move only
along roads.
You've been asked to plan out routes for the vehicles; each route can use any road/railway multiple times. One of the most important aspects to consider is safety — in order to avoid accidents at railway crossings, the train and the bus must not arrive at the
same town (except town n) simultaneously.
Under these constraints, what is the minimum number of hours needed for both vehicles to reach town n (the maximum of arrival times
of the bus and the train)? Note, that bus and train are not required to arrive to the town n at the same moment of time, but are allowed
to do so.
Input
The first line of the input contains two integers n and m (2 ≤ n ≤ 400, 0 ≤ m ≤ n(n - 1) / 2) —
the number of towns and the number of railways respectively.
Each of the next m lines contains two integers u and v,
denoting a railway between towns u and v (1 ≤ u, v ≤ n, u ≠ v).
You may assume that there is at most one railway connecting any two towns.
Output
Output one integer — the smallest possible time of the later vehicle's arrival in town n. If it's impossible for at least one of the
vehicles to reach town n, output - 1.
Sample test(s)
input
4 2 1 3 3 4
output
2
input
4 6
1 21 31 4
2 32 4
3 4
output
-1
input
5 5
4 23 5
4 5
5 1
1 2
output
3
Note
In the first sample, the train can take the route
and
the bus can take the route
.
Note that they can arrive at town 4 at the same time.
In the second sample, Absurdistan is ruled by railwaymen. There are no roads, so there's no way for the bus to reach town 4.
#include <bits/stdc++.h> using namespace std; #define inf (1<<30) __int64 c[405][405]; __int64 d[405][405]; int main() { int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) for(int k=1;k<=n;k++) c[i][k]=inf,d[i][k]=inf; for(int i=0;i<m;i++) { __int64 u,v; scanf("%I64d%I64d",&u,&v); c[u][v]=1; c[v][u]=1; } for(int i=1;i<=n;i++) for(int k=1;k<=n;k++) if(c[i][k]==inf) d[i][k]=1; for(int k=1;k<=n;k++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { if(c[i][k]+c[k][j]<c[i][j]) c[i][j]=c[i][k]+c[k][j]; if(d[i][k]+d[k][j]<d[i][j]) d[i][j]=d[i][k]+d[k][j]; } if(c[1] +d[1] >=inf) printf("-1\n"); else printf("%I64d\n",max(c[1] ,d[1] )); return 0; }
相关文章推荐
- Android Studio来了,它能取代Eclipse吗?
- 黑马程序员——IO流知识详解
- 产品经理的未来
- 做高频通用还是低频专业
- css改变默认滚动条样式
- 递归创建并输出链表
- cf 602 B(模拟)
- Eclipse将引用了第三方jar包的Java项目打包成jar
- Android常见的Event-driven方案
- Python开发简单记事本
- 汉字转拼音
- App技术框架
- 3d游戏中剧情开启扭转镜头的实现
- Linux shell 倒计时脚本
- 黑马程序员——Java基础——IO流(二)
- 14.3 位块传输
- 【ZooKeeper Notes 8】 zookeeper 权限控制
- cf 602 A(进制转换)
- [spark]计算视频播放数每个区间占用比例
- ST3插件——PlainTasks的使用