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

建议使用的浏览器:

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

3321:Rose Shop

题目描述
Small JH,the boss of the rose shop, preparated many roses for the valentine's day.It’s too much people come and buy roses,so Small JH have to put the roses back in every t(0 < t) minutes.The roses put as a thwartwise tower in the rail (look at the picture).You can get the number of rose with n(0<n<13) rows is n*(n + 1)/ 2.
a bundle of rose like this:

@
@~@~@
@~@\@/@~@
\@|@|@|@/
\\\|///
\\|//
\|/
=&=
/|\

This is the rose in the rail:

The rose numbered as below:

1
2 3
4 5 6
7 8 9 10

The rule of putting the rose in is to find a empty bay where the number is smallest and put the rose in.We can suppose he add the rose spend no time,the customer should wait after Small JH add the rose.
The shop opened at 8:00am and closed at 11:00pm(the customer can buy rose at 11:00pm but the boss will not add the rose at 11:00pm).He want to know the situation of the customer buy the rose and the placement of rose after 11:00pm.If the customer see the shop is closed,he will leave.
输入解释
The input will consist of several cases, please deal with till the end of file. Each case contains three integers N , T and M (0<N<13, 0<T, 0<M<=100) representing there are N rows of roses,small JH add the rose every T minutes and M customer.Then follow M*2 lines as below format:
hh:mm k
a1 a2…ak
stand for at hh:mm the customer want to buy k roses,ai means he wants the rose numberd ai.at the same time,only one customer into the shop.
the time is increase and 0 < k <= n*(n + 1)/ 2, 0 < ai <= n*(n+1)/2.
输出解释
For each customer, when the shop Not yet opened,print “Not yet open for business”. if he can buy at least one rose,please print “You bought X beams of rose”.X means the number of the customer have bought.otherwise,print “What a pity!”.
After all, print the state of rose.
输入样例
2 1 1
8:00 1
2
2 10000 1
8:00 1
2
输出样例
You bought 1 beams of rose
+---------------------+
|          @          |
|        @~@~@        |
|      @~@\@/@~@      |
|    @ \@|@|@|@/ @    |
|  @~@~@\\\|///@~@~@  |
|@~@\@/@~@\|/@~@\@/@~@|
|\@|@|@|@/\|/\@|@|@|@/|
| \\\|/// =&= \\\|/// |
|  \\|//  /|\  \\|//  |
|   \|/         \|/   |
|   =&=         =&=   |
|   /|\         /|\   |
+---------------------+
You bought 1 beams of rose
+---------------------+
|          @          |
|        @~@~@        |
|      @~@\@/@~@      |
|      \@|@|@|@/ @    |
|       \\\|///@~@~@  |
|        \\|/@~@\@/@~@|
|         \|/\@|@|@|@/|
|         =&= \\\|/// |
|         /|\  \\|//  |
|               \|/   |
|               =&=   |
|               /|\   |
+---------------------+
来自杭电HDUOJ的附加信息
Author Tuzkier
Recommend wxl

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

源链接: HDU-3321

最后修改于 2020-10-25T23:02:19+00:00 由爬虫自动更新

共提交 0

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