poj1734Sightseeing trip【floyd+最小环+路径记录】
来源:互联网 发布:mysql quarter 编辑:程序博客网 时间:2024/06/06 07:02
Language:
Sightseeing trip
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5771 Accepted: 2236 Special Judge
Description
There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the town. To earn as much as possible from this attraction, the agency has accepted a shrewd decision: it is necessary to find the shortest route which begins and ends at the same place. Your task is to write a program which finds such a route.
In the town there are N crossing points numbered from 1 to N and M two-way roads numbered from 1 to M. Two crossing points can be connected by multiple roads, but no road connects a crossing point with itself. Each sightseeing route is a sequence of road numbers y_1, ..., y_k, k>2. The road y_i (1<=i<=k-1) connects crossing points x_i and x_{i+1}, the road y_k connects crossing points x_k and x_1. All the numbers x_1,...,x_k should be different.The length of the sightseeing route is the sum of the lengths of all roads on the sightseeing route, i.e. L(y_1)+L(y_2)+...+L(y_k) where L(y_i) is the length of the road y_i (1<=i<=k). Your program has to find such a sightseeing route, the length of which is minimal, or to specify that it is not possible,because there is no sightseeing route in the town.
In the town there are N crossing points numbered from 1 to N and M two-way roads numbered from 1 to M. Two crossing points can be connected by multiple roads, but no road connects a crossing point with itself. Each sightseeing route is a sequence of road numbers y_1, ..., y_k, k>2. The road y_i (1<=i<=k-1) connects crossing points x_i and x_{i+1}, the road y_k connects crossing points x_k and x_1. All the numbers x_1,...,x_k should be different.The length of the sightseeing route is the sum of the lengths of all roads on the sightseeing route, i.e. L(y_1)+L(y_2)+...+L(y_k) where L(y_i) is the length of the road y_i (1<=i<=k). Your program has to find such a sightseeing route, the length of which is minimal, or to specify that it is not possible,because there is no sightseeing route in the town.
Input
The first line of input contains two positive integers: the number of crossing points N<=100 and the number of roads M<=10000. Each of the next M lines describes one road. It contains 3 positive integers: the number of its first crossing point, the number of the second one, and the length of the road (a positive integer less than 500).
Output
There is only one line in output. It contains either a string 'No solution.' in case there isn't any sightseeing route, or it contains the numbers of all crossing points on the shortest sightseeing route in the order how to pass them (i.e. the numbers x_1 to x_k from our definition of a sightseeing route), separated by single spaces. If there are multiple sightseeing routes of the minimal length, you can output any one of them.
Sample Input
5 71 4 11 3 3003 1 101 2 162 3 1002 5 155 3 20
Sample Output
1 3 5 2
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#define inf 99999999using namespace std;const int maxn=110;int path[maxn];int map[maxn][maxn];int dist[maxn][maxn];int road[maxn][maxn];int num;void record(int s,int t){if(road[s][t]){record(s,road[s][t]);record(road[s][t],t);}else path[num++]=t;}int floyd(int n){memset(path,0,sizeof(path));memset(road,0,sizeof(road));int ans=inf;for(int k=1;k<=n;++k){for(int i=1;i<k;++i){for(int j=i+1;j<k;++j){if(ans>dist[i][j]+map[i][k]+map[k][j]){ans=dist[i][j]+map[i][k]+map[k][j];num=0;path[num++]=i;record(i,j);path[num++]=k;}}}for(int i=1;i<=n;++i){for(int j=1;j<=n;++j){if(dist[i][j]>dist[i][k]+dist[k][j]){dist[i][j]=dist[i][k]+dist[k][j];road[i][j]=k;}}}}return ans;}int main(){int i,j,n,m;while(scanf("%d%d",&n,&m)!=EOF){for(i=1;i<=n;++i){for(j=1;j<=n;++j){map[i][j]=dist[i][j]=inf;}}int a,b,c;for(i=0;i<m;++i){scanf("%d%d%d",&a,&b,&c);if(map[a][b]>c){map[a][b]=map[b][a]=c;dist[a][b]=dist[b][a]=c;}}int ans=floyd(n);if(ans<inf){for(i=0;i<num;++i){if(i){printf(" %d",path[i]);}else {printf("%d",path[i]);}}printf("\n");}else {printf("No solution.\n");}}return 0;}
1 0
- poj1734Sightseeing trip【floyd+最小环+路径记录】
- poj1734Sightseeing trip floyd最小环
- poj1734Sightseeing trip(floyd求最小环)
- POJ1734 Sightseeing trip 【Floyd】+【最小环】+【路径记录】
- POJ 1734 Sightseeing trip (Floyd 最小环+记录路径)
- POJ 1734 Sightseeing trip【floyd求最小环+记录路径】
- poj 1734 Sightseeing trip (floyd求最小环并记录路径)
- Sightseeing trip(求最小环,记录路径)
- Sightseeing trip floyd求最小环
- 【POJ】1734 Sightseeing trip floyd最小环
- POJ1734 Sightseeing trip【Floyd】【最小环】
- poj 1734 Sightseeing trip(floyd 最小环)
- Poj 1734 Sightseeing trip floyd最小环
- URAL1004 Sightseeing Trip Floyd 最小环
- POJ 1734 Sightseeing trip Floyd求最小环
- POJ 1734 Sightseeing trip Floyd求最小环
- POJ 1734 Sightseeing trip Floyd求最小环
- poj 1734 Sightseeing trip 扩展floyd求最小环
- Windows下安装Redmine
- MindMapper荧光笔功能是如何进行使用的
- iOS9系统自带字体
- 八大排序方法解析与巧记(二)插入排序
- oracle获取当天数据
- poj1734Sightseeing trip【floyd+最小环+路径记录】
- oracle SQL性能优化
- android知识点杂锦
- android studio生成aar包并在其他工程引用aar包
- scikit-learn初探:多种回归方法建立预测电力输出模型(二)
- vlan 与 虚拟网卡
- CSS 初识
- mac php+apache+mysqladmin 环境配置和安装
- 替换文本