PTA 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.

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

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <sstream>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_maxnn
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
//#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn=210;
int gra[maxn][maxn];
bool vis[maxn];
int N,M,K,c1,c2,d,fg,ct,m;
int main()
{
    scanf("%d %d",&N,&M);
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            gra[i][j]=inf;
    while(M--){
        scanf("%d %d %d",&c1,&c2,&d);
        gra[c1][c2]=gra[c2][c1]=d;
    }
    scanf("%d",&K);
    int j=0;
    m=inf;
    for(int i=1;i<=K;i++){
        memset(vis,0,N+1);
        d=0;
        fg=0;
        ct=0;
        scanf("%d %d",&M,&c1);
        printf("Path %d: ",i);
        while(--M){
            scanf("%d",&c2);
            if(gra[c1][c2]<inf||fg==2){
                if(!vis[c2]){
                    vis[c2]=1;
                    ct++;
                }
                else
                    fg=1;
                d+=gra[c1][c2];
                c1=c2;
            }
            else
                fg=2;
        }
        if(fg!=2)
            printf("%d ",d);
        else
            printf("NA ");
        if(ct==N&&fg==0)
            printf("(TS simple cycle)\n");
        else if(fg==1&&ct==N)
            printf("(TS cycle)\n");
        else
            printf("(Not a TS cycle)\n");
        if(fg!=2&&ct==N&&m>d){
            j=i;
            m=d;
        }
    }
    printf("Shortest Dist(%d) = %d",j,m);
    return 0;
}