码迷,mamicode.com
首页 > 其他好文 > 详细

UVa - 1025 - A Spy in the Metro

时间:2015-07-01 18:16:44      阅读:202      评论:0      收藏:0      [点我收藏+]

标签:

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: t1t2,..., tN - 1 ( 1技术分享ti技术分享70), 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: d1d2,..., 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: e1e2,..., 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

动态规划,注意状态函数的定义即可。其他技巧还有不需要把t,d,e全部存下来,只需要输入的时候顺便计算出一个状态数组hasTrain即可。时间复杂度是O(nT)。

AC代码:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
#include <bitset> 
#include <cassert> 
#include <cmath>
#include <functional>

using namespace std;

const int maxt = 75;
const int maxm = 55;
const int maxT = 205;
const int maxn = 55;
const int inf = 0x3f3f3f3f;

int n, T, M1, M2;
int t[maxt], d;
int dp[maxT][maxn]; // dp(i,j)表示时刻i,在车站j,最少还需要等待多长时间
int hasTrain[maxT][maxn][2];
// hasTrain[t][i][0]表示时刻t,在车站i是否有往右开的火车

void init()
{
	memset(t, 0, sizeof(t));
	memset(dp, 0, sizeof(dp));
	memset(hasTrain, 0, sizeof(hasTrain));
	cin >> T;
	for (int i = 1; i <= n - 1; i++) {
		cin >> t[i];
	}

	cin >> M1;
	for (int i = 1; i <= M1; i++) {
		cin >> d;
		for (int j = 1; j <= n - 1; j++) {
			if (d <= T) {
				hasTrain[d][j][0] = 1;
			}
			d += t[j];
		}
	}

	cin >> M2;
	for (int i = 1; i <= M2; i++) {
		cin >> d;
		for (int j = n - 1; j >= 1; j--) {
			if (d <= T) {
				hasTrain[d][j + 1][1] = 1;
			}
			d += t[j];
		}
	}
}

// 动态规划求解
void solve()
{
	for (int i = 1; i <= n - 1; i++) {
		dp[T][i] = inf;
	}
	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 && hasTrain[i][j][0] && i + t[j] <= T) {
				dp[i][j] = min(dp[i][j], dp[i + t[j]][j + 1]);
			}
			if (j > 1 && hasTrain[i][j][1] && i + t[j - 1] <= T) {
				dp[i][j] = min(dp[i][j], dp[i + t[j - 1]][j - 1]);
			}
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	int kase = 0;
	while (cin >> n && n) {
		init();
		solve();
		cout << "Case Number " << ++kase << ": ";
		if (dp[0][1] >= inf) {
			cout << "impossible\n";
		}
		else {
			cout << dp[0][1] << "\n";
		}
	}

	return 0;
}




版权声明:本文为博主原创文章,未经博主允许不得转载。

UVa - 1025 - A Spy in the Metro

标签:

原文地址:http://blog.csdn.net/zyq522376829/article/details/46712239

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!