zoukankan      html  css  js  c++  java
  • POJ 3311 Hie with the Pie

    Hie with the Pie

    Time Limit: 2000ms
    Memory Limit: 65536KB
    This problem will be judged on PKU. Original ID: 3311
    64-bit integer IO format: %lld      Java class name: Main
     

    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 ways to go from i to j via other locations, due to different speed limits, traffic lights, etc. Also, the time values may not be symmetric, i.e., the time to go directly from location i to j may not be the same as the time to go directly from location j to i. An input value of n = 0 will terminate input.

     

    Output

    For each test case, you should output a single number indicating the minimum time to deliver all of the pizzas and return to the pizzeria.

     

    Sample Input

    3
    0 1 10 10
    1 0 1 2
    10 1 0 10
    10 2 10 0
    0

    Sample Output

    8

    Source

     
    解题:状压dp
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 #include <algorithm>
     6 #include <climits>
     7 #include <vector>
     8 #include <queue>
     9 #include <cstdlib>
    10 #include <string>
    11 #include <set>
    12 #include <stack>
    13 #define LL long long
    14 #define pii pair<int,int>
    15 #define INF 0x3f3f3f3f
    16 using namespace std;
    17 int n,m,d[20][20],dp[1<<11][20];
    18 void Floyd(){
    19     for(int k = 0; k <= n; k++){
    20         for(int i = 0; i <= n; i++){
    21             for(int j = 0; j <= n; j++){
    22                 d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
    23             }
    24         }
    25     }
    26 }
    27 int main() {
    28     while(scanf("%d",&n),n) {
    29         for(int i = 0; i <= n; i++)
    30             for(int j = 0; j <= n; j++)
    31                 scanf("%d",d[i]+j);
    32         Floyd();
    33         int u = 1<<(n+1);
    34         memset(dp,-1,sizeof(dp));
    35         dp[1][0] = 0;
    36         for(int i = 1; i < u; i++){
    37             for(int j = 0; j <= n; j++){
    38                 if(dp[i][j] == -1) continue;
    39                 for(int k = 0; k <= n; k++)
    40                     if(k != j && dp[i|(1<<k)][k] == -1 || dp[i|(1<<k)][k] > dp[i][j] + d[j][k])
    41                         dp[i|(1<<k)][k] = dp[i][j] + d[j][k];
    42             }
    43         }
    44         printf("%d
    ",dp[u-1][0]);
    45     }
    46     return 0;
    47 }
    View Code
  • 相关阅读:
    vue引用js报错Uncaught SyntaxError: Unexpected token <
    VS Code离线安装扩展方法
    zTree、jsTree排序和简单的js数字字符串混合排序方法
    C# 如何读取匿名类型Anonymous Type的属性
    ajax使用jsonp请求方式
    VS2015 Bad Request解决方法
    C# json对象中包含数组对象时,如何存入数据库
    js 最短代码生成随机数(字符串、id)
    HDU 6395 Sequence 杜教板子题
    hdu GuGuFishtion 6390 数论 欧拉函数
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4004806.html
Copyright © 2011-2022 走看看