1150 Travelling Salesman Problem

实际上挺水。。。

#include <iostream>
#include <stdlib.h>
#include <string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include <unordered_map>
using namespace std;

int main(){
    int v, e;
    cin >> v >> e;
    int m1[201][201];
    fill(m1[0], m1[0]+ 201 * 201, 0);
    
    for (int i = 0; i < e; i++) {
        int v1, v2, d;
        cin >> v1 >> v2 >> d;
        m1[v1][v2] = d;
        m1[v2][v1] = d;
    }
    int num;
    cin >> num;
    int index = -1;
    int shortest = 9999999;

    for (int i = 0; i < num; i++) {
        int k;
        cin >> k;
        vector<int> route;
        for (int j = 0; j < k; j++) {
            int node;
            cin >> node;
            route.push_back(node);
        }
        int total = 0;
        int vis[201];
        fill(vis, vis + 201, 0);
        bool f1=1, f2=1,f3=1;
        for (int j = 0; j < k-1; j++) {
            if (m1[route[j]][route[j + 1]] == 0) {
                f1 = 0;
            }
            else {
                total += m1[route[j]][route[j + 1]];
                vis[route[j + 1]]++;
            }
        }

        for (int a = 1; a <= v; a++) {
            if (vis[a] == 0) {
                f2 = 0;
            }
            else if (vis[a] > 1) {
                f3 = 0;
            }
        }

        printf("Path %d: ", i + 1);
        
        if (f1 != 0 && f2!=0) {
            if (shortest > total) {
                shortest = total;
                index = i + 1;
            }
        }
        if (f1 == 0) {
            printf("NA ");
        }
        else {
            printf("%d ", total);
        }

        if (f2 == 0) {
            printf("(Not a TS cycle)\n");
        }
        else if (f3 == 0) {
            printf("(TS cycle)\n");
        }
        else {
            printf("(TS simple cycle)\n");
        }

    }
    printf("Shortest Dist(%d) = %d\n", index, shortest);
    system("pause");
};