当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2359:The Final Countdown

题目描述
When Doctor Doom modeled LAI-BACH (the Latverian Aerospace Institute, Bolograd Active Control Headquarters) on Mission Command with
NASA, he perhaps cribbed from the source a bit too closely.

NASA (and therefore LAI-BACH) have a peculiar way of handling countdowns to missions. While the clock may state that it is, say, thirty minutes
until liftoff for a rocket or shuttle, there are built-in holds where the clock is stopped for a set amount of time. For example, there may be a 15-minute
hold when the countdown reaches the 8-minute mark. The end result is that more time passes from the beginning of the countdown to the end than
the numbers on the clock would imply.

LAI-BACH uses a simple "command file" format to manage holds for their countdowns on their computer systems. All commands start with a
positive integer no greater than 1440 (countdowns longer than a day make Doctor Doom angry), followed by a directive. The format of the
commands is as follows:



All conditions are represented by short strings of lowercase letters, no more than 20 characters long; their actual values are not provided in the
command structure, as they are determined by actual conditions during the launch (whether the fuel tanks have been topped off, whether the
Fantastic Four is currently fighting Doctor Doom, and so on), but they are always either true or false and do not change during the course of a single
countdown. A hold time n is a positive integer no more than 60 (minutes), as long delays also irritate Victor.

Given a particular command file, you are to determine both the shortest possible time and the longest possible time that the countdown can run. The
commands may be present in any order, but there will always be one and only one START directive; there will be precisely as much whitespace on
each line as dictated by the format given above. No two commands in a command file will reference the same minute t.
输入解释
Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of
the following components:

A line containing a single integer L (1 ≤ L ≤ 100) indicating the number of lines in the particular "command file"; and
A series of L lines representing the command file, in the format described above.
输出解释
For each data set, print "min TO max", where min is the shortest possible time the countdown can last in minutes, and max is the longest possible
time the countdown can last in minutes.
输入样例
2
3
30 START
15 HOLD 5
10 HOLD 5 IF fantasticfour
3
75 HOLD 20 IF yellowlightblinks
150 HOLD 30 IF NOT fueled
300 START
输出样例
35 TO 40
300 TO 350
来自杭电HDUOJ的附加信息
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-2359

最后修改于 2020-10-25T22:52:45+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
3000/1000MS(Java/Others) 32768/32768K(Java/Others)