F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Waiting ten thousand years for Love

Time Limit: 10000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1317    Accepted Submission(s): 432


Problem Description
It was ten thousand years, after Demon Lemon caught Yifenfei¡¯s love. In order to revenge and save his love, Yifenfei have been practising sword all day long and his Kongfu skills becomes so powerful that he can kill Demon Lemon immediately. Recently, Yifenfei have found Lemon¡¯s castle, and now he is going to kill Lemon. At the same time, hearing about the terrible news, Demon Lemon is now preparing for escaping...

Now Yifenfei has got the map of the castle.
Here are all symbols of the map:
Only one ¡®Y¡¯ Indicates the start position of Yifenfei.
Only one ¡®L¡¯ Indicates the position of Demon Lemon.
¡®.¡¯ Indicate the road that Yifenfei can walk on it, or fly over it.
¡®#¡¯ Indicate the wall that Yifenfei can not walk or flay through it.
¡®@¡¯ Indicate the trap that Yifenfei can not walk on it, but can fly over it.

Yifenfei can walk or fly to one of up, down, left or right four directions each step, walk costs him 2 seconds per step, fly costs him 1 second per step and 1 magic power. His magic power will not increased, and if his magic power is zero, he can not fly any more.

Now Yifenfei asks you for helping him kill Demon Lemon smoothly. At the same time, Demon Lemon will Leave the castle Atfer T seconds. If Yifenfei can¡¯t kill Demon Lemon this time, he have to wait another ten thousand years.
 

Input
Lots of test cases, please process to end of file. In each test case, firstly will have four integers N, M, T, P(1 <= N, M, P <= 80, 1 <= T <= 100000), indicates the size of map N * M, the Lemon¡¯s leaving time(after T seconds, Lemon will disappeared) and Yifenfei¡¯s magic power. Then an N * M two-dimensional array follows indicates the map.
 

Output
For each test case, first Print a line ¡°Case C:¡±, C indicates the case number. Then, if Yifenfei can kill Demon Lemon successfully, Print ¡°Yes, Yifenfei will kill Lemon at T sec.¡±, T indicates the minimum seconds he must cost. Otherwise, Print ¡±Poor Yifenfei, he has to wait another ten thousand years.¡±
 

Sample Input
2 3 2 2 Y@L ### 2 3 4 1 Y@L ### 2 3 4 0 Y.L ### 2 3 3 0 Y.L ###
 

Sample Output
Case 1: Yes, Yifenfei will kill Lemon at 2 sec. Case 2: Poor Yifenfei, he has to wait another ten thousand years. Case 3: Yes, Yifenfei will kill Lemon at 4 sec. Case 4: Poor Yifenfei, he has to wait another ten thousand years.
 

Hint
Hint
Case 1: Yifenfei cost 1 second and 1 magic-power fly to ¡®@¡¯,
but he can not step on it, he must cost another 1 second
and 1 magic-power fly to ¡®L¡¯ and kill Lemon immediately.
Case 2: When Yifenfei Fly to ¡®@¡¯, he has no power to fly,
and is killed by trap.
 

Author
lemon
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-11 18:37:35, Gzip enabled