UVA - 1025 A Spy in the Metro

Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After
several thrilling events we find her in the first station of Algorithms City Metro, examining the time
table. The Algorithms City Metro consists of a single line with trains running both ways, so its time
table is not complicated.
Maria has an appointment with a local spy at the last station of Algorithms City Metro. Maria
knows that a powerful organization is after her. She also knows that while waiting at a station, she is
at great risk of being caught. To hide in a running train is much safer, so she decides to stay in running
trains as much as possible, even if this means traveling backward and forward. Maria needs to know
a schedule with minimal waiting time at the stations that gets her to the last station in time for her
appointment. You must write a program that finds the total waiting time in a best schedule for Maria.
The Algorithms City Metro system has N stations, consecutively numbered from 1 to N. Trains
move in both directions: from the first station to the last station and from the last station back to the
first station. The time required for a train to travel between two consecutive stations is fixed since all
trains move at the same speed. Trains make a very short stop at each station, which you can ignore
for simplicity. Since she is a very fast agent, Maria can always change trains at a station even if the

trains involved stop in that station at the same time.

Input
The input file contains several test cases. Each test case consists of seven lines with information as
follows.
Line 1. The integer N (2 ≤ N ≤ 50), which is the number of stations.
Line 2. The integer T (0 ≤ T ≤ 200), which is the time of the appointment.
Line 3. N − 1 integers: t1, t2, . . . , tN−1 (1 ≤ ti ≤ 20), representing the travel times for the trains
between two consecutive stations: t1 represents the travel time between the first two stations, t2
the time between the second and the third station, and so on.
Line 4. The integer M1 (1 ≤ M1 ≤ 50), representing the number of trains departing from the first
station.
Line 5. M1 integers: d1, d2, . . . , dM1 (0 ≤ di ≤ 250 and di < di+1), representing the times at which
trains depart from the first station.
Line 6. The integer M2 (1 ≤ M2 ≤ 50), representing the number of trains departing from the N-th
station.
Line 7. M2 integers: e1, e2, . . . , eM2 (0 ≤ ei ≤ 250 and ei < ei+1) representing the times at which
trains depart from the N-th station.
The last case is followed by a line containing a single zero.
Output
For each test case, print a line containing the case number (starting with 1) and an integer representing
the total waiting time in the stations for a best schedule, or the word ‘impossible’ in case Maria is
unable to make the appointment. Use the format of the sample output.
Sample Input
4
55
5 10 15
4
0 5 10 20
4
0 5 10 15
4
18
1 2 3
5
0 3 6 10 12
6
0 3 5 7 12 15
2
30
20
1
20
7
1 3 5 7 11 13 17
0
Sample Output
Case Number 1: 5
Case Number 2: 0

Case Number 3: impossible

地铁有n个车站，从左到右编号为1~n。有m1辆列车从第一站开始往后开，还有m2辆列车从第n站开始往左开。在时刻0，mario从第一站出发，目的是在时刻T（0<=T<=200）会见车站n的一个间谍。车站等车时容易被抓，所以使在车站等待的总时间尽量短。

第一行为n，第二行为T，第三行有n-1个整数，分别表示各个车站间的行驶时间。第四行为m1，第五行是各列车的出发时间。第六七行表示从第n站出发向左开的列车，格式同第4、5行。

输出最少等待时间，无解输出impossible.

[cpp]  view plain  copy

1. #include<cstdio>  
2. #include <iostream>  
3. #include<cstring>  
4. using namespace std;  
5. int you[55],zuo[55],times[220],dp[220][55],t[220][55][2];  
6. int main()  
7. {  
8.     int kase=0;  
9. int n;  
10. while(cin>>n&&n!=0)  
11. {  
12.     memset(t,0,sizeof(t));  
13.     int T,m1,m2;  
14. cin>>T;  
15. for(int i=1;i<=n-1;i++)  
16. cin>>times[i];  
17. times[0]=0;  
18. times[n]=0;  
19. cin>>m1;  
20. for(int i=1;i<=m1;i++)  
21.     cin>>zuo[i];  
22. cin>>m2;  
23. for(int i=1;i<=m2;i++)  
24. cin>>you[i];  
25. int temp;  
26. for(int i=1;i<=m1;i++)  
27.     {  temp=0;  
28.         for(int j=1;j<=n-1;j++)  
29.     {t[zuo[i]+temp][j][0]=1; temp+=times[j];  
30.    if(temp>T) break;}  
31.     }  
32. for(int i=1;i<=m2;i++)  
33.     { temp=0;  
34.         for(int j=n;j>1;j--)  
35.     {t[you[i]+temp][j][1]=1; temp+=times[j-1];  
36.     if(temp>T) break;}  
37. }  
38. for(int i=1;i<=n-1;i++)  
39.     dp[T][i]=10000;  
40. dp[T][n]=0;  
41. for(int i=T-1;i>=0;i--)//此部分参考了紫书  
42.     for(int j=1;j<=n;j++)  
43. {  
44.     dp[i][j]=dp[i+1][j]+1;  
45.     if(j<n&&t[i][j][0]&&i+times[j]<=T)  
46.         dp[i][j]=min(dp[i][j],dp[i+times[j]][j+1]);  
47.   if(j>1&&t[i][j][1]&&i+times[j-1]<=T)  
48.     dp[i][j]=min(dp[i][j],dp[i+times[j-1]][j-1]);  
49. }  
50.     cout<<"Case Number "<<++kase<<": ";  
51.     if(dp[0][1]>=10000) cout<<"impossible"<<endl;  
52.     else cout<<dp[0][1]<<endl;  
53. }  
54.     return 0;  
55. }