HDU 3768 Shopping

Shopping

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 563    Accepted Submission(s): 185

Problem Description

You have just moved into a new apartment and have a long list of items you need to buy. Unfortunately, to buy this many items requires going to many different stores. You would like to minimize the amount of driving necessary to buy all the items you need.

Your city is organized as a set of intersections connected by roads. Your house and every store is located at some intersection. Your task is to find the shortest route that begins at your house, visits all the stores that you need to shop at, and returns to your house.

 

Input

The first line of input contains a single integer, the number of test cases to follow. Each test case begins with a line containing two integers N and M, the number of intersections and roads in the city, respectively. Each of these integers is between 1 and 100000, inclusive. The intersections are numbered from 0 to N-1. Your house is at the intersection numbered 0. M lines follow, each containing three integers X, Y, and D, indicating that the intersections X and Y are connected by a bidirectional road of length D. The following line contains a single integer S, the number of stores you need to visit, which is between 1 and ten, inclusive. The subsequent S lines each contain one integer indicating the intersection at which each store is located. It is possible to reach all of the stores from your house.

 

Output

For each test case, output a line containing a single integer, the length of the shortest possible shopping trip from your house, visiting all the stores, and returning to your house.

 

Sample Input

  
  

   
   1
4 6
0 1 1
1 2 1
2 3 1
3 0 1
0 2 5
1 3 5
3
1
2
3
  
  

 

Sample Output

  
  

   
   4
  
  

 

Source

University of Waterloo Local Contest 2010.07.10

 

Recommend

notonlysuccess   |   We have carefully selected several similar problems for you:   2722  3769  3770  3772  2433 

解题思路：给你一个无向图，求从0号点开始遍历所有的指定点再回到0号点的最短路径，指定点只有10个，所以先spfa然后dfs即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define Inf 999999999
using namespace std;
int head1[100005],head2[15],k,dis[15][100005];
bool vis[15];
struct
{
    int e;
    int w;
    int next;
}edge1[200005],edge2[205];
void add1(int s,int e,int w)
{
    edge1[k].e=e;
    edge1[k].w=w;
    edge1[k].next=head1[s];
    head1[s]=k++;
}
void add2(int s,int e,int w)
{
    edge2[k].e=e;
    edge2[k].w=w;
    edge2[k].next=head2[s];
    head2[s]=k++;
}
void spfa(int s,int n,int *dis)
{
    int i,st,ed;
    bool visit[100005];
    queue<int> x;
    memset(visit,false,sizeof(visit));
    for(i=0;i<n;i++)
        dis[i]=Inf;
    dis[s]=0;
    x.push(s);
    while(!x.empty())
    {
        st=x.front();
        x.pop();
        visit[st]=false;
        for(i=head1[st];i!=-1;i=edge1[i].next)
        {
            ed=edge1[i].e;
            if(dis[ed]>dis[st]+edge1[i].w)
            {
                dis[ed]=dis[st]+edge1[i].w;
                if(!visit[ed])
                {
                    visit[ed]=true;
                    x.push(ed);
                }
            }
        }
    }
}
int dfs(int pos,int len,int n,int c)
{
    int i,ans=Inf;
    vis[pos]=true;
    if(pos==0)
    {
        if(c==n)
            return len;
        else
            return Inf;
    }
    for(i=head2[pos];i!=-1;i=edge2[i].next)
    {
        int ed=edge2[i].e;
        if(!vis[ed]||ed==0)
            ans=min(ans,dfs(ed,len+edge2[i].w,n,c+1));
    }
    vis[pos]=false;
    return ans;
}
int main()
{
    int i,j,m,n,a,b,c,t,p[15],q,cnt,ans;
    scanf("%d",&t);
    while(t--)
    {
        k=cnt=0;ans=Inf;
        memset(head1,-1,sizeof(head1));
        memset(head2,-1,sizeof(head2));
        scanf("%d%d",&n,&m);
        while(m--)
        {
            scanf("%d%d%d",&a,&b,&c);
            add1(a,b,c);
            add1(b,a,c);
        }
        scanf("%d",&q);
        p[cnt]=0;
        spfa(0,n,dis[cnt]);
        cnt++;
        while(q--)
        {
            scanf("%d",&p[cnt]);
            spfa(p[cnt],n,dis[cnt]);
            cnt++;
        }
        k=0;
        for(i=0;i<cnt;i++)
            for(j=0;j<cnt;j++)
                if(i!=j)
                    add2(i,j,dis[i][p[j]]);
        for(i=1;i<cnt;i++)
        {
            memset(vis,false,sizeof(vis));
            vis[0]=true;
            ans=min(ans,dfs(i,dis[0][p[i]],cnt,1));
        }
        printf("%d\n",ans);
    }
    return 0;
}