Einbahnstra e (German for a one-way

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.
Input
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

結果 (中文) 1:

Einbahnstra e (一条单行道德语) 是一条街道上的车辆应只有一个方向移动。具有单向街道的一个原因是交通的便于通过拥挤地区更为畅顺。在城市中心，特别是老城市像开罗和大马士革，这非常有用。仔细规划保证能让你上从任何位置开始的任何位置。不过，司机必须仔细规划他们的路线以避免延长旅行由于单行道。经验丰富的司机知道有多个路径以任何两个地点之间旅行。不仅如此，可能会有多个道路在相同的两个地点之间。知道任何两个位置之间的最短途径是必须的!这是更重要的驾驶车辆很难机动 (垃圾卡车，牵引卡车等)。你刚开始一份新的工作在牵引车的公司。公司拥有一批牵引卡车停在公司车库。一辆拖车升降机前面或以将它拉直的破车后轮回公司的车库。你接听来自世界各地的城市大约需要被拖的破车。这些汽车有拖相同的顺序，因为你接听电话。你的工作是，劝谕拖车司机最短的路，以便收集关于所有损坏的汽车回公司的车库。在年底的一天，你必须向总距离乘卡车的管理报告。InputYour 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 -> BA <-v - BA <-v -> BA 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. OutputFor each test case, print the total distance traveled using the following format:k . VK 在哪里测试事例编号 (从 1 开始)，是一个空间，和 V 是结果。

結果 (中文) 3:

einbahnstra E（为单向街德国）是一个街上的车辆只能朝一个方向。单向街道的一个原因是为了方便更顺畅的交通流通过拥挤的地区。这是有用的，在城市中心，特别是像开罗和大马士革这样的老城市。仔细规划，确保您可以从任何地点开始任何位置。然而，司机必须小心地计划他们的路线，以避免延长他们的行程，由于单行道。有经验的司机知道在任何地点之间有多条路可以行驶。不仅如此，在同一个地点之间可能有多条路。知道任何地点之间的最短路径是必须的！这是更重要的，当驾驶车辆，是很难机动（垃圾卡车，拖车等）你刚开始在一家汽车公司做新的工作。该公司有一批拖车停在公司的车库。一辆拖车把一辆破汽车的前轮或后轮抬起，以把它拉回到公司的车库。你收到来自城市各地区的电话，这是需要被拖走的车。当你接到电话的同时，汽车也会被拖走。你的工作是向拖车司机提供最短的路，以便收集所有损坏的汽车回到公司的车库。在一天结束时，你必须向管理层的总距离的卡车旅行。输入你的程序将被测试一个或多个测试用例。每一个测试案例的第一行指定一个或多个空格分隔的三个数字（氮、碳、和）。这个城市有不同的名称，包括该公司的车库。是数辆破汽车。是城市道路的数量。注意0，100，0，10000，和1000。二号线是由1个字+字，第一个是该公司的车库的位置，其余的被损坏的汽车的位置。一个位置是一个字，由10个字母或更少。字母的情况是重要的。二线之后，会有一条直线，每一条路都有一条路。使用这三种格式中的一条路：一个-第五-第五乙-乙一个< - >A和B是两个不同地点的名称，而V是一个正整数（不超过1000）表示这条路的长度。第一种格式指定一个单行道从位置到乙，二是指定一个单行道从乙到一个，而最后指定一个双向的街道之间。箭头“，和乙被一个或多个空格隔开。测试用例的结束是指定一行有三个零（氮，碳，和）。在下面的例子中的测试案例是相同的，在图中。输出对于每一个测试案例，使用下面的格式打印总距离：钾。v在测试的情况下，测试用例数（从1开始）是一个空间，并且是结果。