首页 > 代码库 > UVA - 116 Unidirectional TSP

UVA - 116 Unidirectional TSP

注意……可穿墙……

#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
const int inf=1<<31;
int a[20][110];
int dp[20][110];
int n,m,ans;
int dfs(int x,int y)
{
	int i,tx,ty;
	if(dp[x][y]!=inf)
		return dp[x][y];
	dp[x][y]=a[x][y];
	ty=y+1;
	if(ty<m)
		for(i=-1;i<2;i++)
		{
			tx=x+i;
			if(tx<0)
				tx=n-1;
			else if(tx>=n)
				tx=0;
			if(dp[x][y]==a[x][y])
				dp[x][y]=dfs(tx,ty)+a[x][y];
			else
				dp[x][y]=min(dp[x][y],dfs(tx,ty)+a[x][y]);
		}
	return dp[x][y];
}
void out(int x,int y)
{
	int tx[10];
	int i,ty;
	cout<<x+1;
	ans+=a[x][y];
	ty=y+1;
	if(ty<m)
	{
		tx[0]=(x-1+n)%n;
		tx[1]=x;
		tx[2]=(x+1)%n;
		sort(tx,tx+3);
		for(i=0;i<3;i++)
		{
			if(dp[x][y]==dp[tx[i]][ty]+a[x][y])
			{
				cout<<" ";
				out(tx[i],ty);
				return;
			}
		}
	}
	cout<<endl;
}
int main()
{
	int i,j,s;
	while(cin>>n>>m)
	{
		for(i=0;i<n;i++)
			for(j=0;j<m;j++)
			{
				cin>>a[i][j];
				dp[i][j]=inf;
			}
		s=0;
		for(i=0;i<n;i++)
		{
			dfs(i,0);
			if(dp[i][0]<dp[s][0])
				s=i;
		}
		/*for(i=0;i<n;i++)
		{
			for(j=0;j<m;j++)
				cout<<dp[i][j]<<" ";
			cout<<endl;
		}
		return 0;*/
		ans=0;
		out(s,0);
		cout<<ans<<endl;
	}
	return 0;
}

Unidirectional TSP
Time Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu

SubmitStatus

Description

Download as PDF


 Unidirectional TSP 

Background

Problems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing wire length. The Traveling Salesperson Problem (TSP) -- finding whether all the cities in a salesperson‘s route can be visited exactly once with a specified limit on travel time -- is one of the canonical examples of an NP-complete problem; solutions appear to require an inordinate amount of time to generate, but are simple to check.

This problem deals with finding a minimal path through a grid of points while traveling only from left to right.

The Problem

Given an tex2html_wrap_inline352 matrix of integers, you are to write a program that computes a path of minimal weight. A path starts anywhere in column 1 (the first column) and consists of a sequence of steps terminating in column n (the last column). A step consists of traveling from column i to columni+1 in an adjacent (horizontal or diagonal) row. The first and last rows (rows 1 andm) of a matrix are considered adjacent, i.e., the matrix ``wraps‘‘ so that it represents a horizontal cylinder. Legal steps are illustrated below.

picture25

The weight of a path is the sum of the integers in each of the n cells of the matrix that are visited.

For example, two slightly different tex2html_wrap_inline366 matrices are shown below (the only difference is the numbers in the bottom row).

picture37

The minimal path is illustrated for each matrix. Note that the path for the matrix on the right takes advantage of the adjacency property of the first and last rows.

The Input

The input consists of a sequence of matrix specifications. Each matrix specification consists of the row and column dimensions in that order on a line followed bytex2html_wrap_inline376 integers wherem is the row dimension and n is the column dimension. The integers appear in the input in row major order, i.e., the firstn integers constitute the first row of the matrix, the second n integers constitute the second row and so on. The integers on a line will be separated from other integers by one or more spaces. Note: integers are not restricted to being positive. There will be one or more matrix specifications in an input file. Input is terminated by end-of-file.

For each specification the number of rows will be between 1 and 10 inclusive; the number of columns will be between 1 and 100 inclusive. No path‘s weight will exceed integer values representable using 30 bits.

The Output

Two lines should be output for each matrix specification in the input file, the first line represents a minimal-weight path, and the second line is the cost of a minimal path. The path consists of a sequence ofn integers (separated by one or more spaces) representing the rows that constitute the minimal path. If there is more than one path of minimal weight the path that islexicographically smallest should be output.

Sample Input

5 6
3 4 1 2 8 6
6 1 8 2 7 4
5 9 3 9 9 5
8 4 1 3 2 6
3 7 2 8 6 4
5 6
3 4 1 2 8 6
6 1 8 2 7 4
5 9 3 9 9 5
8 4 1 3 2 6
3 7 2 1 2 3
2 2
9 10 9 10

Sample Output

1 2 3 4 4 5
16
1 2 1 5 4 5
11
1 1
19

Source


Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 5. Dynamic Programming
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Dynamic Programming ::Non Classical (medium difficulty)
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming ::Non Classical (The Easier Ones)
Root :: Programming Challenges (Skiena & Revilla) :: Chapter 11
Root :: AOAPC II: Beginning Algorithm Contests (Second Edition) (Rujia Liu) :: Chapter 9. Dynamic Programming ::Examples
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming ::Non Classical (The Easier Ones)

SubmitStatus


UVA - 116 Unidirectional TSP