Takahashi正在探索一个包含N个房间的线性洞穴，初始位于第1个房间，时间限制为T。每个房间之间的移动会消耗时间，并存在M个奖励房间可以增加时间限制。问题在于判断Takahashi能否在时间限制内到达最后一个房间。
B - Explore
Time Limit: 2 sec / Memory Limit: 1024 MB
Score : 200 points
Problem Statement
Takahashi is exploring a cave in a video game.
The cave consists of N rooms arranged in a row. The rooms are numbered Room from the entrance.
Takahashi is initially in Room 1, and the time limit is T.
For each , he may consume a time of
to move from Room i to Room
. There is no other way to move between rooms. He cannot make a move that makes the time limit 0 or less.
There are M bonus rooms in the cave. The i-th bonus room is Room
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
