| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 0.5 초 | 2048 MB | 6 | 5 | 5 | 83.333% |
Bob is playing a card game where he must defeat a monster. Before the game starts, Bob’s power is set to $P,ドル the monster’s health is set to $H,ドル and Bob receives a deck of $N$ cards in his hands.
Each card in the deck belongs to one of the following types:
The game is played in turns. In each turn, Bob must play exactly one card from his hand, after which the card is moved to a discard pile. If Bob has no cards left in his hand at the end of a turn, he retrieves all cards from the discard pile and can use them again in any order.
The monster is beaten as soon as its health reaches 0ドル$ or less. Is it possible for Bob to beat the monster? If so, what is the minimum number of turns required?
The first line contains three integers $N$ (1ドル ≤ N ≤ 50$), $P$ (0ドル ≤ P ≤ 10^9$) and $H$ (1ドル ≤ H ≤ 10^9$), indicating respectively the number of cards in the deck, Bob’s initial power and the monster’s initial health.
Each of the next $N$ lines describes a card. The content of the line depends on the type of the card, as follows:
*” (asterisk) and an integer $X$ (1ドル ≤ X ≤ 10^9$), representing the multiply factor provided by the card.+” (plus sign) and an integer $Y$ (1ドル ≤ Y ≤ 10^9$), indicating the increment provided by the card.!” (exclamation mark).Output a single line with an integer indicating the minimum number of turns required to beat the monster, or the character “*” (asterisk) if it is impossible to beat the monster.
3 0 20 * 2 ! + 5
4
To beat the monster in 4ドル$ turns, Bob can play as follows:
+ 5ドル$ card, so his power becomes 5ドル$.* 2ドル$ card, so his power becomes 10ドル$.! card, so the monster’s health becomes 10ドル$. Since now Bob has no cards in his hands, all three cards go back to him.! card, so the monster’s health becomes 0ドル,ドル and the monster is beaten.1 0 1 !
*
1 1 1 + 1
*