1150. Travelling Salesman Problem (25)-PAT甲级真题

题意

思路

题解

#include<bits/stdc++.h>
using namespace std;
int gra[201][201];
int n, m, k, len, a, b, l;
int ans1, ans2 = INT_MAX;
int main(){
	cin>>n>>m;
	while(m--){
		cin>>a>>b>>l;
		gra[a][b] = gra[b][a] = l;
	}
	cin>>k;
	for(int i = 1; i <= k; i ++){
		printf("Path %d: ", i);
		cin>>len;
		vector<int> rec(len), exi(len + 2);
		int ptr = 1, dist = 0, f = 0;
		for(int j = 0; j < len; j ++){
			scanf("%d", &rec[j]);
			exi[rec[j]]++;
			if(j != 0){
				dist += gra[rec[j - 1]][rec[j]];
				if(!gra[rec[j - 1]][rec[j]]) f = 1;
			}
		}
		while(exi[ptr]) ptr++;
		if(f == 1) puts("NA (Not a TS cycle)");
		else{
			printf("%d ", dist);
			if(ptr != n + 1|| rec.front() != rec.back()) puts("(Not a TS cycle)");
			else{
				if(ans2 > dist) ans1 = i, ans2 = dist;
				if(len == n + 1) puts("(TS simple cycle)");
				else puts("(TS cycle)");				
			}
		}
	}
	printf("Shortest Dist(%d) = %d", ans1, ans2);
	return 0;
}

题目

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
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值