1150 Travelling Salesman Problem (25分)

1150 Travelling Salesman Problem (25分)

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 C
​1
​​ C
​2
​​ … C
​n
​​

where n is the number of cities in the list, and C
​i
​​ '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.

简单的图论：
简单的判断一下
1.isCycle
2.isSimplycycle
3.notCycle

这题我一开始犯了个小错导致测试点3，4有点问题，我先看到了
这句话，然后我就给minDistance赋了101。。。 他这个最大距离指的只是单单2个city的距离，而题目所需要的是整条路径的Distance，so，拉满就完事儿了，，
另外，有些存树图关系的地方，当你用二维数组存关系和值的时候，可能会有些坑，你需要开他给的大小的2倍以上

代码：

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
const int MAXV = 210;
int n, m, G[MAXV][MAXV];
int main(){
    cin >> n >> m;
    fill(G[0], G[0] + MAXV * MAXV, 0);
    while(m--){
        int a, b, l;
        cin >> a >> b >> l;
        G[a][b] = G[b][a] = l;
    }
    int k, num;
    cin >> k;
    int minIndex = -1, minDistance = 100000000;
    for(int i=1;i<=k;i++){
        cin >> num;
        vector<int> temp(num);
        set<int> s;
        for (int i = 0; i < num;i++){
            cin >> temp[i];
            s.insert(temp[i]);
        }
        int isCycle = temp[0] == temp[temp.size() - 1] && s.size() == n;
        int length = 0, pathNotFound = false;
        for (int i = 1; i < temp.size();i++){
            int pre = temp[i - 1], now = temp[i];
            if(G[pre][now]==0){
                isCycle = false;
                pathNotFound = true;
            }
            length += G[pre][now];
        }
        length=pathNotFound?-1:length;
        int isSimplyCycle = isCycle && temp.size() == n + 1;
        printf("Path %d: ", i);
        if(length==-1){
            printf("NA ");
        }else{
            printf("%d ", length);
        }
        if(!isCycle){
            printf("(Not a TS cycle)\n");
        }else if(isSimplyCycle){
            printf("(TS simple cycle)\n");
        }else{
            printf("(TS cycle)\n");
        }
        if(isCycle&&length<minDistance){
            minDistance = length;
            minIndex = i;
        }
    }
    printf("Shortest Dist(%d) = %d",minIndex,minDistance);
    return 0;
}