2014ACM大赛题目.doc

题目描述恶魔猎手尤迫安野心勃勃. 他背叛了暗夜精灵,率深藏在海底的那加企图叛变:守望者在与尤迪安的交锋中遭遇了围杀. 被困在一个荒芜的大岛上。为了杀死守望者, 尤迪安开始对这个荒岛施咒, 这座岛很快就会沉下去, 到那时, 刀上的所有人都会遇难: 守望者的跑步速度,为 17m/s , 以这样的速度是无法逃离荒岛的。庆幸的是守望者拥有闪烁法术, 可在 1s 内移动 60m , 不过每次使用闪烁法术都会消耗魔法值 10 点。守望者的魔法值恢复的速度为 4点/s , 只有处在原地休息状态时才能恢复。现在已知守望者的魔法初值 M ,他所在的初始位置与岛的出口之间的距离 S ,岛沉没的时间 T。你的任务是写一个程序帮助守望者计算如何在最短的时间内逃离荒岛, 若不能逃出, 则输出守望者在剩下的时间内能走的最远距离。注意: 守望者跑步、闪烁或休息活动均以秒(s) 为单位。且每次活动的持续时间为整数秒。距离的单位为米(m) 。输入输入文件 仅一行,包括空格隔开的三个非负整数 M,S,T。输出输出文件 包含两行: 第1 行为字符串"Yes" 或"No" ( 区分大小写) ,即守望者是否能逃离荒岛。第2 行包含一个整数,第一行为"Yes" ( 区分大小写)时表示守望着逃离荒岛的最短时间第一行为"No" ( 区分大小写) 时表示守望者能走的最远距离。样例输入 39 200 4 样例输出 No 197 提示 7 180 9 Yes 30% 的数据满足:1 <= T<= 10 ,1 <=S<= 100 50% 的数据满足:1 <= T <= 1000 ,1 <= S <= 10000 100% 的数据满足:1 <= T <= 300000 ,0 <= M<=1000 1 <=S <= 10^8 题目描述 A group of friends has pleted their CS assignments, and because of the nice weather, they decide to go to Joe's house for a BBQ. Unfortunately, after all that coding, they are too tired to walk. Fortunately, between them they have enough cars to take everyone. Joe remembers that he needs to stop off at the supermarket along the way to buy some burgers and pop. Jenn proposes that they stop at her house to get a frisbee. Jim decides that he doesn't like burgers, and wants to grab a pizza along the way. After having spent so long in puter lab, Jerry's eyes have e very sensitive to sunlight, so he needs to stop at his house