The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. (Quoted from "https://en.wikipedia.org/wiki/Travelling_salesman_problem".)
In this problem, you are supposed to find, from a given list of cycles, the one that is the closest to the solution of a travelling salesman problem.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers N (2<N≤200), the number of cities, and M, the number of edges in an undirected graph. Then M lines follow, each describes an edge in the format City1 City2 Dist
, where the cities are numbered from 1 to N and the distance Dist
is positive and is no more than 100. The next line gives a positive integer K which is the number of paths, followed by K lines of paths, each in the format:
n C1 C2 ... Cn
where n is the number of cities in the list, and Ci's are the cities on a path.
Output Specification:
For each path, print in a line Path X: TotalDist (Description)
where X
is the index (starting from 1) of that path, TotalDist
its total distance (if this distance does not exist, output NA
instead), and Description
is one of the following:
TS simple cycle
if it is a simple cycle that visits every city;TS cycle
if it is a cycle that visits every city, but not a simple cycle;Not a TS cycle
if it is NOT a cycle that visits every city.
Finally print in a line Shortest Dist(X) = TotalDist
where X
is the index of the cycle that is the closest to the solution of a travelling salesman problem, and TotalDist
is its total distance. It is guaranteed that such a solution is unique.
Sample Input:
6 10
6 2 1
3 4 1
1 5 1
2 5 1
3 1 8
4 1 6
1 6 1
6 3 1
1 2 1
4 5 1
7
7 5 1 4 3 6 2 5
7 6 1 3 4 5 2 6
6 5 1 4 3 6 2
9 6 2 1 6 3 4 5 2 6
4 1 2 5 1
7 6 1 2 5 4 3 1
7 6 3 2 5 4 1 6
Sample Output:
Path 1: 11 (TS simple cycle)
Path 2: 13 (TS simple cycle)
Path 3: 10 (Not a TS cycle)
Path 4: 8 (TS cycle)
Path 5: 3 (Not a TS cycle)
Path 6: 13 (Not a TS cycle)
Path 7: NA (Not a TS cycle)
Shortest Dist(4) = 8
题意:跟"旅行商问题"一点关系都没有,也不是关于图的问题,挂羊头卖狗肉;给一个无向图,多组路径,每组分别输出它的边权之和、是不是环、是不是简单环
分析:又是暴力法,先计算边权之和,若两顶点无直接相连的边,则边权之和为NA;若起始点与终点不同,则非环;若是环,用bool数组计算该点是否被访问超过1次(起始点除外);最后输出边权和最小值及其ID
emmmmm......好像就是个模拟吧
#define INF 0x7fffffff
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
const int MAXN=210;
int N,M,K,Nk;
int vex[MAXN][MAXN];
int mind=INF,minID=0;
int main()
{
fill(vex[0],vex[0]+MAXN*MAXN,INF);
int u,v,w;
scanf("%d%d",&N,&M);
for(int i=0;i<M;++i){
scanf("%d%d%d",&u,&v,&w);
vex[u][v]=vex[v][u]=w;
}
scanf("%d",&K);
for(int i=1;i<=K;++i){
bool vis[MAXN]={false},sim=true,cycle=true,na=false;
scanf("%d%d",&Nk,&u);
int td=0,S=u;
for(int j=1;j<Nk;++j){
scanf("%d",&v);
if(vex[u][v]!=INF)
td+=vex[u][v];
else{
na=true;
cycle=false;
}
if(vis[v]) sim=false;
vis[v]=true;
u=v;
}
for(int j=1;j<=N;++j)
if(vis[j]==false) cycle=false;
if(S!=v || cycle==false){
printf("Path %d: %s (Not a TS cycle)\n",i,na?"NA":to_string(td).c_str());
continue;
}
if(sim)
printf("Path %d: %s (TS simple cycle)\n",i,na?"NA":to_string(td).c_str());
else
printf("Path %d: %s (TS cycle)\n",i,na?"NA":to_string(td).c_str());
if(mind>td){
mind=td;
minID=i;
}
}
printf("Shortest Dist(%d) = %d\n",minID,mind);
return 0;
}