|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||3||3||3||100.000%|
One of the first questions faced by the traveler in a subway system is: How much will the trip cost? While it should be fairly straightforward to present this information clearly, it actually sometimes takes lookups in several tables, posted in different places in a subway station, followed by complicated computations. Then, if you make the right sacrifices, invoke the right demons, etc., you might eventually get the right answer. Given the risks with invoking the wrong demons, it would be preferable to write a computer program to help with this. And that’s what we’re going to do now.
We’ll focus on just one subway line. You’ll be given a price table stating how much a trip of s stations costs, for each s ≥ 1. Then, you’ll be given the names of the stations in order, as well as the names of your starting and ending station. You are to compute the fare. Notice that you can use the subway line in both directions.
The first line is the number K of input data sets, followed by the K data sets, each of the following form:
The first line of each data set contains an integer 2 ≤ n ≤ 50. That’s the number of stops of this line. This is followed by n − 1 lines, with line s giving you an integer, the price for going s stops. (s = 1 means you get off at the next stop after you get on. There will be no cases where you get off at the same stop.) Next come n lines, each with the name of a station (in order), which consists of just lowercase letters. All station names will of course be distinct.
The last two lines are the name of your starting and ending stations. They will match the names of stations on the list, and be different from each other.
For each data set, output “Data Set x:” on a line by itself, where x is its number. Then, output the price for your trip. Each data set should be followed by a blank line.
2 3 1 13 unionstation usc culvercity unionstation usc 4 2 3 4 citycenter hollywood ucla beach beach hollywood
Data Set 1: 1 Data Set 2: 3