原创 2013年12月05日 16:02:10
Problem Description
Einbahnstra  e (German for a one-way street) is a street on which vehicles should only move in one direction. One reason for having one-way streets is to facilitate a smoother flow of traffic through crowded areas. This is useful in city centers, especially old cities like Cairo and Damascus. Careful planning guarantees that you can get to any location starting from any point. Nevertheless, drivers must carefully plan their route in order to avoid prolonging their trip due to one-way streets. Experienced drivers know that there are multiple paths to travel between any two locations. Not only that, there might be multiple roads between the same two locations. Knowing the shortest way between any two locations is a must! This is even more important when driving vehicles that are hard to maneuver (garbage trucks, towing trucks, etc.)

You just started a new job at a car-towing company. The company has a number of towing trucks parked at the company's garage. A tow-truck lifts the front or back wheels of a broken car in order to pull it straight back to the company's garage. You receive calls from various parts of the city about broken cars that need to be towed. The cars have to be towed in the same order as you receive the calls. Your job is to advise the tow-truck drivers regarding the shortest way in order to collect all broken cars back in to the company's garage. At the end of the day, you have to report to the management the total distance traveled by the trucks.

Your program will be tested on one or more test cases. The first line of each test case specifies three numbers (N , C , and R ) separated by one or more spaces. The city has N locations with distinct names, including the company's garage. C is the number of broken cars. R is the number of roads in the city. Note that 0 < N < 100 , 0<=C < 1000 , and R < 10000 . The second line is made of C + 1 words, the first being the location of the company's garage, and the rest being the locations of the broken cars. A location is a word made of 10 letters or less. Letter case is significant. After the second line, there will be exactly R lines, each describing a road. A road is described using one of these three formats:

A -v -> B
A <-v - B
A <-v -> B

A and B are names of two different locations, while v is a positive integer (not exceeding 1000) denoting the length of the road. The first format specifies a one-way street from location A to B , the second specifies a one-way street from B to A , while the last specifies a two-way street between them. A , ``the arrow", and B are separated by one or more spaces. The end of the test cases is specified with a line having three zeros (for N , C , and R .)

The test case in the example below is the same as the one in the figure. 


For each test case, print the total distance traveled using the following format:

k . V

Where k is test case number (starting at 1,) is a space, and V is the result.

Sample Input
4 2 5 NewTroy Midvale Metrodale NewTroy <-20-> Midvale Midvale --50-> Bakerline NewTroy <-5-- Bakerline Metrodale <-30-> NewTroy Metrodale --5-> Bakerline 0 0 0

Sample Output
1. 80





思路:用floyd最方便了- -


#include <iostream>
#include <stdio.h>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;
#define inf 999999999
const int L = 1005;
int n,c,m;
int a[105][105];
char str[1005][100];
int cnt;
map<string,int> mat;

void Floyd()
    int i,j,k;
    for(i = 1; i<=n; i++)
        for(j = 1; j<=n; j++)
            for(k = 1; k<=n; k++)
                    a[j][k] = a[j][i]+a[i][k];

int main()
    int i,j,val,x,y,len,cas = 1,sum,start;
    char s1[100],s2[100],s3[100];
    char from,to;
        sum = 0;
        for(i = 0; i<=n; i++)
            for(j = 0; j<=n; j++)
                a[i][j] = inf;
        for(i = 0; i<=c; i++)
        cnt = 1;
        for(i = 0; i<m; i++)
            scanf("%s %c-%d-%c %s",s1,&from,&val,&to,s3);
                mat[s1] = cnt++;
                mat[s3] = cnt++;
            x = mat[s1],y = mat[s3];
            if(from == '<' && val<a[y][x])
                a[y][x] = val;
            if(to == '>' && val<a[x][y])
                a[x][y] = val;
        start = mat[str[0]];
        for(i = 1; i<=c; i++)
        printf("%d. %d\n",cas++,sum);

    return 0;




hdu 2923 Einbahnstrasse【floyd】

Einbahnstrasse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others...


题意: 给定n个城市,c个目的地(可能有重合的),r条有向边。 接下来是出发点,然后是c个目的地。 接下来r行是路径的信息,箭头代表方向。 求每次从出发点出发到达目的地,然后再回到起点。走c个...

hdu2923 Einbahnstrasse

题意: n个城市,cliang

HDU - 2923- Einbahnstrasse

题目网址:HDU-2923-Einbahnstrasse Einbahnstrasse Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32...
  • ZscDst
  • ZscDst
  • 2017年04月11日 20:20
  • 131

HDU 2923 Einbahnstrasse(最短路径,多源点到单源点)

Einbahnstrasse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

hdu 2923 Einbahnstrasse

/* 题目大意是:某个城市有n个路口,r条道路(有单向的和双向的),c辆车坏了,求一辆一辆地把坏车拖回来需要走多长的距离 因为是多源最短路(拖车公司和坏车的地点都作为源点)问题,用Floyd ...

hdu 2923 Einbahnstrasse 最短路spfa+map容器

题意:从初始点到多个点的来回最短路径总和。 这题输入的时候比较麻烦,注意用map容器存储各点。注意一个目标点可能出现多次。 #include #include #include #include...

HDU 2923 Einbahnstrasse

#include #include #include #include #include #define N 1005 #include #define INF 1

【最短路+dijkstra】杭电 hdu 2923 Einbahnstrasse

/* THE PROGRAM IS MADE BY PYY */ /*----------------------------------------------------------------...

HDU 2923 Einbahnstrasse

英语渣就是这点不好。。。 巨恶心这种描述多的题。。 大意就是求 从一个点出发,到某些点,然后又从那些点返回的距离之和的 最小值。 Dijkstra+邻接矩阵。 正向建图,求出出发...