ZOJ - 3166 Lazy Tourist
2017-04-05 20:08
162 查看
ZOJ - 3166 Lazy Tourist
Fat Murphy is really a lazy guy. When he goes out for sightseeing, only he cared about is to get back to the hotel which he stayed in as soon as possible. Taday is the Valentine's day, Fat Murphy's girl friend plans to make a tour of Hangzhou with him. Poor
Murphy has to agree with that, or his girl friend will be really angry. As lazy as he was, he begins to collect information about Hangzhou for his own purpose. There are N sceneries in Hangzhou, and some of them are connected by a one way road. Besides, some
of the sceneries have a hotel in it. Fat Murphy wants to choose a hotel to check in, when he goes out for sightseeing, he can get back to this hotel in a minimal time.
Input
First line: two integers N, C, indicates the number of the sceneries and the number of the hotels. 1 <= N <= 100, 0 <= C <= N
Second line: C distinct integers represent the index of the scenery which has a hotel.
Third line: an integer M, indicates the number of the paths, 0 <= M <= N*(N-1)
The following M lines: each line contains threes integers: a, b, d, represents there is a road from a to b, and the time needed to pass this road is d. 1 <= d <= 1000
Process to the end of file.
Output
For each case, output a single number represents the index of the hotel that Fat Murphy chooses.
If there is more than one optimal choice, just output the smallest one. If there is no choice, output "I will nerver go to that city!"
Sample Input
Sample Output
【分析】有m个城市,c个旅馆,n条单向路。
求从旅馆出发在回到旅馆的最短路径。
将所有的路径都算出来,然后找最小的。
#include <bits/stdc++.h>
using namespace std;
#define cl(a,b) memset(a,b,sizeof a);
const int INF = 0x3f3f3f3f;
const int maxn = 110;
int dis[maxn][maxn],a[maxn];
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)){
cl(a,0);
for(int i=0;i<m;i++){
scanf("%d",a+i);
}
int k;
scanf("%d",&k);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dis[i][j] = INF;
}
}
while(k--){
int u,v,d;
scanf("%d%d%d",&u,&v,&d);
dis[u][v] = d;
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dis[i][j] = min(dis[i][j],dis[i][k]+dis[k][j]);
}
}
}
int ans = 0,mi = INF;
for(int i=0;i<m;i++){
if(dis[a[i]][a[i]] < mi){
ans = a[i];
mi = dis[a[i]][a[i]];
}
}
if(ans){
printf("%d\n",ans);
}
else
printf("I will nerver go to that city!\n");
}
return 0;
}
Fat Murphy is really a lazy guy. When he goes out for sightseeing, only he cared about is to get back to the hotel which he stayed in as soon as possible. Taday is the Valentine's day, Fat Murphy's girl friend plans to make a tour of Hangzhou with him. Poor
Murphy has to agree with that, or his girl friend will be really angry. As lazy as he was, he begins to collect information about Hangzhou for his own purpose. There are N sceneries in Hangzhou, and some of them are connected by a one way road. Besides, some
of the sceneries have a hotel in it. Fat Murphy wants to choose a hotel to check in, when he goes out for sightseeing, he can get back to this hotel in a minimal time.
Input
First line: two integers N, C, indicates the number of the sceneries and the number of the hotels. 1 <= N <= 100, 0 <= C <= N
Second line: C distinct integers represent the index of the scenery which has a hotel.
Third line: an integer M, indicates the number of the paths, 0 <= M <= N*(N-1)
The following M lines: each line contains threes integers: a, b, d, represents there is a road from a to b, and the time needed to pass this road is d. 1 <= d <= 1000
Process to the end of file.
Output
For each case, output a single number represents the index of the hotel that Fat Murphy chooses.
If there is more than one optimal choice, just output the smallest one. If there is no choice, output "I will nerver go to that city!"
Sample Input
5 2 1 3 6 1 2 1 2 5 5 5 1 2 3 5 3 4 3 1 5 4 1 5 2 1 3 4 1 2 1 2 3 2 3 4 3 4 5 4
Sample Output
3 I will nerver go to that city!
【分析】有m个城市,c个旅馆,n条单向路。
求从旅馆出发在回到旅馆的最短路径。
将所有的路径都算出来,然后找最小的。
#include <bits/stdc++.h>
using namespace std;
#define cl(a,b) memset(a,b,sizeof a);
const int INF = 0x3f3f3f3f;
const int maxn = 110;
int dis[maxn][maxn],a[maxn];
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)){
cl(a,0);
for(int i=0;i<m;i++){
scanf("%d",a+i);
}
int k;
scanf("%d",&k);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dis[i][j] = INF;
}
}
while(k--){
int u,v,d;
scanf("%d%d%d",&u,&v,&d);
dis[u][v] = d;
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dis[i][j] = min(dis[i][j],dis[i][k]+dis[k][j]);
}
}
}
int ans = 0,mi = INF;
for(int i=0;i<m;i++){
if(dis[a[i]][a[i]] < mi){
ans = a[i];
mi = dis[a[i]][a[i]];
}
}
if(ans){
printf("%d\n",ans);
}
else
printf("I will nerver go to that city!\n");
}
return 0;
}
相关文章推荐
- ZOJ 3166 Lazy Tourist
- zoj 3166 Lazy Tourist(最短路Floyd)
- ZOJ 3166 Lazy Tourist 最短路floyd模版题
- ZOJ 3166 Lazy Tourist 最短路floyd模版题
- zoj 3166 Lazy Tourist 最短路 floyd
- ZOJ 3166题解 最短路径之Floyd算法
- zoj_3166_floyd_好久没打还翻车一次_丢人
- ZOJ-3166
- ZOJ 1045 HangOver
- zoj 2833 friendship
- ZOJ 3792 - Romantic Value (网络流‘最小割)
- ZOJ-1091 Knight Moves(bfs)
- ZOJ 1251 Box of Bricks
- J - What day is that day?(zoj水题)
- ZOj Problem Set-1241
- ZOJ 3556 How Many Sets I
- ZOJ 1405 Tanning Salon
- ZOJ 3780 Paint the Grid Again (模拟)
- ZOJ 1586 QS Network(kruskal)(基础)
- ZOJ 2006 Glass Beads