PAT A1150 Travelling Salesman Problem (25 分) 图

    题目大意：给出图的信息，判断给定的顶点序列是否是 TS cycle, TS simple cycle。所谓 TS cycle，是指从一个顶点出发，最后回到这个顶点，并且图中的每个顶点都被经过。所谓 TS simple cycle，是指在TS cycle的基础上，除了起点经过两次，中间每个顶点都只经过一次。并计算所有给出序列中，满足TS cycle条件的路径的最小长度。如果给定的序列不是一条路径，要输出长度是NA。

    题目本身并不复杂，但是因为判断的东西比较多，所以最好还是分成函数写。首先是判断 TS cycle，要满足以下几个条件：①起点等于终点。②每个顶点都经过。③是一条路径，如果序列中相邻的两个顶点之间没有通路的话，应当判定不是TS cycle, 并且输出长度是NA。之后，如果是TS cycle，再判断除了起点外是否每个顶点都只经过了一次，来判断是否是 TS simple cycle。

    AC代码：

#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;

const int MAXN = 210;
const int INF = 0x7FFFFFFF;
int G[MAXN][MAXN];

bool judgeTSCycle(const vector<int> &v, const vector<int> &visited, int &totalDis, int N)
{
    bool isTSCycle = true;
    if(v[0] != v[v.size() - 1]) isTSCycle = false;
    for (int i = 1; i <= N && isTSCycle; ++i)
    {
        if(visited[i] < 1) isTSCycle = false;
    }
    for (int i = 0; i < v.size() - 1; ++i)
    {
        if(G[v[i]][v[i+1]] < INF) totalDis += G[v[i]][v[i+1]];
        else
        {
            isTSCycle = false;
            totalDis = INF;
            break;
        }
    }
    return isTSCycle;
}

bool judgeSimpleCycle(const vector<int> &v, const vector<int> &visited, int N)
{
    if(visited[v[0]] != 2) return false;
    for (int i = 1; i <= N; ++i)
    {
        if(visited[i] > 1 && i != v[0]) return false;
    }
    return true;
}

int main()
{
    fill(G[0], G[0] + MAXN * MAXN, INF);
    int N, M, K;
    scanf("%d%d", &N, &M);
    for (int i = 0; i < M; ++i)
    {
        int u, v, dis;
        scanf("%d%d%d", &u, &v, &dis);
        G[u][v] = G[v][u] = dis;
    }
    scanf("%d", &K);
    int minIndex = 1, minDis = INF;
    for (int query = 1; query <= K; ++query)
    {
        int size;
        scanf("%d", &size);
        vector<int> v(size);
        vector<int> visited(size + 1);
        for (int i = 0; i < size; ++i)
        {
            scanf("%d", &v[i]);
            visited[v[i]]++;
        }
        int totalDis = 0;
        bool isTSCycle = judgeTSCycle(v, visited, totalDis, N);
        bool isTSSimpleCycle = judgeSimpleCycle(v, visited, N);
        if(isTSCycle && totalDis < minDis)
        {
            minDis = totalDis;
            minIndex = query;
        }
        if(!isTSCycle && totalDis < INF) printf("Path %d: %d (Not a TS cycle)\n", query, totalDis);
        else if(!isTSCycle && totalDis == INF) printf("Path %d: NA (Not a TS cycle)\n", query);
        else if(isTSCycle && !isTSSimpleCycle) printf("Path %d: %d (TS cycle)\n", query, totalDis);
        else if(isTSCycle && isTSSimpleCycle) printf("Path %d: %d (TS simple cycle)\n", query, totalDis);
    }
    printf("Shortest Dist(%d) = %d", minIndex, minDis);
    return 0;
}