UVA 1025 A Spy in the Metro - ACM/ICPC World Finals 2003

#include<bits/stdc++.h>
using namespace std;
int n,m,T,t,i,j,k,a[310],train1[310][310],train2[310][310],dp[310][310];
int main(){
	while(scanf("%d",&n)&&n){
		k++;
		scanf("%d",&T);
		for(i=1;i<n;i++)
			scanf("%d",&a[i]);
		scanf("%d",&m);
		for(i=1;i<=m;i++){
			scanf("%d",&t);
			for(j=1;j<=n;j++){
				train1[t][j]=1;
				t+=a[j];
				if(t>T)break;
			}
		}
		scanf("%d",&m);
		for(i=1;i<=m;i++){
			scanf("%d",&t);
			for(j=n;j>=1;j--){
				train2[t][j]=1;
				t+=a[j-1];
				if(t>T)break;
			}
		}
		for(i=1;i<n;i++)
			dp[T][i]=0x3f3f3f3f;
		dp[T][n]=0;
		for(i=T-1;i>=0;i--)
			for(j=1;j<=n;j++){
				dp[i][j]=dp[i+1][j]+1;
				if(j<n&&train1[i][j]&&i+a[j]<=T)
					dp[i][j]=min(dp[i+a[j]][j+1],dp[i][j]);
				if(j>1&&train2[i][j]&&i+a[j-1]<=T)
					dp[i][j]=min(dp[i+a[j-1]][j-1],dp[i][j]);
			}
		printf("Case Number %d: ",k);
		if(dp[0][1]<0x3f3f3f3f)printf("%d\n",dp[0][1]);
		else printf("impossible\n");
		memset(train1,0,sizeof(train1));
		memset(train2,0,sizeof(train2));
	}
	return 0;
}