UVA 1025 A Spy in the Metro
A Spy in the Metro
64-bit integer IO format: %lld Java class name: Main
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 ( 2N50), which is the number of stations.
- Line 2.
- The integer T ( 0T200), which is the time of the appointment.
- Line 3.
- N - 1 integers: t1, t2,..., tN - 1 ( 1ti70), representing the travel times for the trains between two consecutive stations: t1 represents the travel time between the first two stations, t2the time between the second and the third station, and so on.
- Line 4.
- The integer M1 ( 1M150), representing the number of trains departing from the first station.
- Line 5.
- M1 integers: d1, d2,..., dM1 ( 0di250 and di < di + 1), representing the times at which trains depart from the first station.
- Line 6.
- The integer M2 ( 1M250), representing the number of trains departing from the N-th station.
- Line 7.
- M2 integers: e1, e2,..., eM2 ( 0ei250 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
Source
1 #include <bits/stdc++.h> 2 using namespace std; 3 int dp[1000][260],cost[260],n,m1,m2,t; 4 bool train[1000][260][2]; 5 int main() { 6 int kase = 1; 7 while(scanf("%d",&n),n) { 8 scanf("%d",&t); 9 for(int i = 2; i <= n; ++i) 10 scanf("%d",cost + i); 11 scanf("%d",&m1); 12 memset(train,false,sizeof train); 13 for(int i = 0,dt; i < m1; ++i) { 14 scanf("%d",&dt); 15 train[dt][1][0] = true; 16 for(int j = 2; j <= n; ++j) { 17 dt += cost[j]; 18 train[dt][j][0] = true; 19 } 20 } 21 scanf("%d",&m2); 22 for(int i = 0,dt; i < m2; ++i) { 23 scanf("%d",&dt); 24 train[dt][n][1] = true; 25 for(int j = n; j > 1; --j) { 26 dt += cost[j]; 27 train[dt][j-1][1] = true; 28 } 29 } 30 memset(dp,0x3f,sizeof dp); 31 dp[t][n] = 0; 32 for(int i = t-1; i >= 0; --i) { 33 for(int j = 1; j <= n; ++j) { 34 dp[i][j] = dp[i+1][j] + 1; 35 if(j < n && train[i][j][0] && i + cost[j+1] <= t) 36 dp[i][j] = min(dp[i][j],dp[i+cost[j+1]][j+1]); 37 if(j > 1 && train[i][j][1] && i + cost[j] <= t) 38 dp[i][j] = min(dp[i][j],dp[i+cost[j]][j-1]); 39 } 40 } 41 printf("Case Number %d: ",kase++); 42 if(dp[0][1] >= 0x3f3f3f3f) puts("impossible"); 43 else printf("%d\n",dp[0][1]); 44 } 45 return 0; 46 }
相关文章
- 创龙OMAPL138开发板测试Device is held in reset. Take the device out of reset, and retry the operation.
- SQLBackupAndFTP The server principal "NT AUTHORITYSYSTEM" is not able to access the database "xxxx"
- 项目ITP(四) javaweb http json 交互 in action (服务端 spring 手机端 提供各种工具类)勿喷!
- The magic method __set() must have public visibility and cannot be static in
- [Tools] Create Files in the Terminal from the Clipboard with PBPaste
- [HTML5] Add an SVG Image to a Webpage and Get a Reference to the Internal Elements in JavaScript
- [WASM] Run WebAssembly in Node.js using the node-loader
- [Typescript Kaop-ts] Use AOP in Vue Components with TypeScript and Kaop-ts
- [Unit Testing] Set the timeout of a Test in Mocha
- [GIF] The Phase Property in GIF Loop Coder
- Mark task complete in checkbox S2 Resource not found for the segment Tasks
- BSP tag in CRM and JSP tag in Hybris
- Inconsistent behavior between text type in Webclient UI and backend customizing
- The data replication requires the processing of single BDoc instances
- Invalid character in the given encoding. Line XX, position XX.解决方法
- 解决The type or namespace name 'XXXX' does not exist in the namespace 'XXXXXXXXX' 的错误
- HDMI_IN_开发指南
- 解决The type or namespace name 'XXXX' does not exist in the namespace 'XXXXXXXXX' 的错误
- 已解决To enable them in other operations, rebuild TensorFlow with the appropriate compiler flags
- 已解决FutureWarning: The default value of regex will change from True to False in a future version. In
- The superclass "javax.servlet.http.HttpServlet" was not found on the Java Build Path
- 解决办法:The name 'Response' does not exist in the current context