UVA10537 The Toll! Revisited dijkstra

有两种节点，一种是大写字母，一种是小写字母，当时小写字母是要付1各单位的过路费，当时大写字母的时候要付当前自己财务的1/20分之一当做过路费。

求最少带多少个物品从起点到终点能在最后交付的时候有k个物品。

这个问题我们倒着求解，求从终点到起点的最短路。然后在根据每个点到终点的最小消耗输出ASCII码序最小的路径。

The Toll! Revisited

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit]   [Go Back]   [Status]  

Description

Problem G

Toll! Revisited

Input: Standard Input

Output: Standard Output

Time Limit: 1 Second

 

Sindbad the Sailor sold 66 silver spoons to the Sultan of Samarkand. The selling was quite easy; but delivering was complicated. The items were transported over land, passing through several towns and villages. Each town and village demanded an entry toll. There were no tolls for leaving. The toll for entering a village was simply one item. The toll for entering a townwas one piece per 20 items carried. For example, to enter a town carrying 70 items, you had to pay 4 items as toll. The towns and villages were situated strategically between rocks, swamps and rivers, so you could not avoid them.

 

Figure 1: To reach Samarkand with 66 spoons, traveling through a town followed by two villages, you must start with 76 spoons.

 

Figure 2: The best route to reach X with 39 spoons, starting from A, is A->b->c->X, shown with arrows in the figure on the left. The best route to reach X with 10 spoons is A->D->X, shown in the figure on the right. The figures display towns as squares and villages as circles.

 

Predicting the tolls charged in each village or town is quite simple, but finding the best route (the cheapest route) is a real challenge. The best route depends upon the number of items carried. For numbers up to 20, villages and towns charge the same. For large numbers of items, it makes sense to avoid towns and travel through more villages, as illustrated in Figure 2.

 

You must write a program to solve Sindbad’s problem. Given the number of items to be delivered to a certain town or village and a road map, your program must determine the total number of items required at the beginning of the journey that uses a cheapest route. You will also have to find the cheapest route. If there is more than one such route, print the lexicographically smallest one (A-n-d is smaller than a-n-d).

Input

The input consists of several test cases. Each test case consists of two parts: the roadmap followed by the delivery details.

 

The first line of the roadmap contains an integer n, which is the number of roads in the map (0 <= n). Each of the next n lines contains exactly two letters representing the two endpoints of a road. A capital letter represents a town; a lower case letter represents a village. Roads can be traveled in either direction.

 

Following the roadmap is a single line for the delivery details. This line consists of three things: an integer p (0 < p < 1000000000) for the number of items that must be delivered, a letter for the starting place, and a letter for the place of delivery. The roadmap is always such that the items can be delivered.

 

The last test case is followed by a line containing the number -1.

 

Output

The output consists of three lines for each test case. First line displays the case number, second line shows the number of items required at the beginning of the journey and third line shows the path according to the problem statement above. Actually, the path contains all the city/village names that Sindbad sees along his journey. Two consecutive city/village names in the path are separated by a hyphen.

 

Sample Input                             Output for Sample Input

1 a Z 19 a Z 5 A D D X A b b c c X 39 A X -1

Case 1: 20 a-Z Case 2: 44 A-b-c-X

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<utility>

using namespace std;

typedef long long LL;
#define MAXN 210
const LL INF=1LL<<60;

vector<int> g[200];
int k,m,vis[MAXN];
LL h[MAXN];

void add(int u,int v)
{
    g[u].push_back(v);
    g[v].push_back(u);
}

LL maintain(char u ,LL x)
{
    if(isupper(u)) return x-(x+19)/20;
    return x-1;
}

LL cost(char u)
{
    if(islower(u)) return h[u]+1;
    LL tmp=h[u]*20/19;
    while(maintain(u,tmp)<h[u]) tmp++;
    return tmp;
}

void dijkstra(int s,int ed)
{

	int i,j,u;
	for(int i=1;i<=200;i++)
        h[i]=INF,vis[i]=0;
    h[s]=k,vis[s]=1;
    for(int i=0;i<g[s].size();i++)
          h[g[s][i]]=cost(s);
	for(i=1;i<=200;i++)
	{
	    if(vis[ed]) break;
		LL min=INF;
		for(j=1;j<=200;j++)
			if(!vis[j] && h[j]<=min)
			{
				u=j;
				min=h[j];
			}
        if(min==INF) break;
		vis[u]=1;
		for(int j=0;j<g[u].size();j++)
        {
            int v=g[u][j];
            if(!vis[v]&&h[v]>=cost(u)) h[v]=cost(u);
        }
	}
}
int main()
{
    int cs=1;
    while(~scanf("%d",&m)&&m!=-1)
    {
        char u[6],v[6];
        for(int i='A';i<='Z';i++)
            g[i].clear();
        for(int i='a';i<='z';i++)
            g[i].clear();
        for(int i=0;i<m;i++)
        {
            scanf("%s%s",u,v);
            add(u[0],v[0]);
        }
        for(int i='A';i<='Z';i++)
            sort(g[i].begin(),g[i].end());
        for(int i='a';i<='z';i++)
            sort(g[i].begin(),g[i].end());
        scanf("%d%s%s",&k,u,v);
        dijkstra(v[0],u[0]);
        printf("Case %d:\n",cs++);
        printf("%lld\n",h[u[0]]);
        printf("%c",u[0]);
        char pre=u[0];
        while(pre!=v[0])
        {
            for(int i=0;i<g[pre].size();i++)
            {
                char to=g[pre][i];
                if(maintain(to,h[pre])>=h[to] )
                {
                    pre=to;
                    break;
                }
            }

            printf("-%c",pre);
        }
        printf("\n");
    }
    return 0;
}