POJ 3311 Hie with the Pie （弗洛伊德/TSP/状态压缩）

最新推荐文章于 2020-06-21 10:41:50 发布

原创

最新推荐文章于 2020-06-21 10:41:50 发布 · 1.3k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#TSP #状态压缩 #弗洛伊德最短路

该博客介绍了如何运用弗洛伊德最短路径算法解决POJ 3311问题，即在一个配送场景中找到最小时间的回程路线。博客提供了输入输出示例，并强调在计算路径时可能存在的非对称旅行时间。

Hie with the Pie (POJ3311)

Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 8639 Accepted: 4722
Description

The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wait for 1 or more (up to 10) orders to be processed before he starts any deliveries. Needless to say, he would like to take the shortest route in delivering these goodies and returning to the pizzeria, even if it means passing the same location(s) or the pizzeria more than once on the way. He has commissioned you to write a program to help him.

Input

Input will consist of multiple test cases. The first line will contain a single integer n indicating the number of orders to deliver, where 1 ≤ n ≤ 10. After this will be n + 1 lines each containing n + 1 integers indicating the times to travel between the pizzeria (numbered 0) and the n locations (numbers 1 to n). The jth value on the ith line indicates the time to go directly from location i to location j without visiting any other locations along the way. Note that there may be quicker