Ultraviolet A 1025 A Spy in the Metro DP, 1025 metro

Ultraviolet A 1025 A Spy in the Metro DP, 1025 metro

DP [I] [j] The minimum waiting time of station j at the time of I .....

There are three possibilities: waiting in the same place, taking the car to the left as the car to the right

A Spy in the Metro Time Limit:3000 MS   Memory Limit:Unknown   64bit IO Format:% Lld & % llu Submit Status Description 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 hasNStations, consecutively numbered from 1N. Trains move in both directions ctions: 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 N50), which is the number of stations. Line 2. The integer T(0 T200), which is the time of the appointment. Line 3. N-1 integers: T1, T2 ,..., TN-1 (1 TI70), 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 M150), representing the number of trains departing from the first station. Line 5. M1 integers: D1, D2 ,..., DM1 (0 DI250 and DI < DI + 1), representing the times at which trains depart from the first station. Line 6. The integer M2 (1 M250), representing the number of trains departing from N-Th station. Line 7. M2 integers: E1, E2 ,..., EM2 (0 EI250 and EI < EI + 1) representing the times at which trains depart from 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 4555 10 1540 5 10 2040 5 10 154181 2 350 3 6 10 1260 3 5 7 12 152302012071 3 5 7 11 13 170 Sample Output Case Number 1: 5Case Number 2: 0Case Number 3: impossible Source ACM-ICPC World Finals: 2003-Beverly Hills Root: aoapc ii: Beginning Algorithm Contests (Second Edition) (Rujia Liu): Chapter 9. Dynamic Programming: Examples Submit Status

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int INF=0x3f3f3f3f;const int maxn=440;int n,T;int t[maxn];int m1,d1[maxn];int m2,d2[maxn];int dp[maxn][maxn];bool hasR[maxn][maxn],hasL[maxn][maxn];void init(){    memset(hasR,0,sizeof(hasR));    memset(hasL,0,sizeof(hasL));    memset(dp,63,sizeof(dp));    memset(t,0,sizeof(t));    memset(d1,0,sizeof(d1));    memset(d2,0,sizeof(d2));}void getH(){    for(int i=0;i<m1;i++)    {        int time=d1[i];        for(int j=1;j<=n;j++)        {            time+=t[j];            hasR[time][j]=true;        }    }    for(int i=0;i<m2;i++)    {        int time=d2[i];        for(int j=n;j>=1;j--)        {            time+=t[j+1];            hasL[time][j]=true;        }    }}int main(){    int cas=1;    while(scanf("%d",&n)!=EOF&&n)    {        init();        scanf("%d",&T);        for(int i=2;i<=n;i++)            scanf("%d",t+i);        scanf("%d",&m1);        for(int i=0;i<m1;i++)            scanf("%d",d1+i);        scanf("%d",&m2);        for(int i=0;i<m2;i++)            scanf("%d",d2+i);        getH();        dp[T][n]=0;        for(int i=T-1;i>=0;i--)        {            for(int j=1;j<=n;j++)            {                dp[i][j]=dp[i+1][j]+1;                if(j<n&&i+t[j+1]<=T&&hasR[i][j])                    dp[i][j]=min(dp[i][j],dp[i+t[j+1]][j+1]);                if(j>1&&i+t[j]<=T&&hasL[i][j])                    dp[i][j]=min(dp[i][j],dp[i+t[j]][j-1]);            }        }        printf("Case Number %d: ",cas++);        if(dp[0][1]>=INF) puts("impossible");        else printf("%d\n",dp[0][1]);    }    return 0;}