CodeForces 602C__The Two Routes
2015-12-02 20:28
281 查看
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<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
const int maxn=4000;
int max(int a,int b)
{
return a>b?a:b;
}
int main()
{
int n,m,vis1[440][440],vis2[440][440];
while(~scanf("%d%d",&n,&m)) {
for(int i=1;i<=n;i++) {
for(int j=i;j<=n;j++) {
vis1[i][j]=vis1[j][i]=maxn;
vis2[i][j]=vis2[j][i]=1;
}
}
int a,b;
for(int i=0;i<m;i++) {
scanf("%d%d",&a,&b);
vis1[b][a]=vis1[a][b]=1;
vis2[b][a]=vis2[a][b]=maxn;
}
for(int k=1;k<=n;k++) {
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
if(vis1[i][k]+vis1[k][j]<vis1[i][j]) {
vis1[i][j]=vis1[i][k]+vis1[k][j];
vis1[j][i]=vis1[i][k]+vis1[k][j];
}
if(vis2[i][k]+vis2[k][j]<vis2[i][j]) {
vis2[i][j]=vis2[i][k]+vis2[k][j];
vis2[j][i]=vis2[i][k]+vis2[k][j];
}
}
}
}
if(vis1[1]
<maxn&&vis2[1]
<maxn) {
printf("%d\n",max(vis1[1]
,vis2[1]
));
}
else
printf("-1\n");
}
return 0;
}
/*
4 2 1 3 3 44 6
1 21 31 4
2 32 4
3 4
5 5
4 23 5
4 5
5 1
1 2
*/
相关文章推荐
- 商务通传递中文及样式
- UI基础整理-7
- 哔哩哔哩真实视频地址解析-初探
- Mysql记录集锦
- 多空对比:一个实用的短中长期资金观察指标介绍
- 网络协议学习笔记-数据链路层-MTU、路径MTU和串行线路吞吐量计算
- Linux里类似批处理中的pause命令
- (十三)break 命令
- MFC中定时器的使用
- 【HDU 2037】今年暑假不AC
- asp.net获取客户端浏览器及主机信息
- 上线发布系统
- 模拟面试
- Session Storage、Cache Storage
- Android应用程序的打包,安装,启动
- Azure平台管理员必须了解的安全问题
- 【openjudge】最大上升子序列和
- (boost::format)io_service和io_service::work的基础使用
- online_judge_1009
- SQL Server---触发