Login

Signup

Login or

Signup with
Have you tried CodeChefs "Code, Compile & Run" Its pretty cool. Try it out by pressing Ctrl+;
and
[X]
typing "ide"

PRACTICE

COMPETE

DISCUSS

COMMUNITY

HELP

ABOUT

Home Practice(easy) Nikhils Dungeon

Nikhils Dungeon

ALL SUBMISSIONS

Problem code: NDUNGEON

Like

SUBMIT

Share 3 people like this. Sign Up to see what your

friends like.

All submissions for this problem are available.

Nikhil has designed the following game. The game is played in a
set of rooms in a dungeon, arranged in an M N
rectangular grid. In one of the rooms, the evil wazir has imprisoned
the princess. The noble prince is on his way to rescue the
princess.
The prince starts in the room at the top left corner of the grid,
which is labelled (1,1). Each room contains some guards. It takes a
certain amount of time before the prince can kill all the guards in
the room he is in. The time taken to kill the guards varies from room
to room. Once he has killed all the guards in a room, he can move on
to any one of its neighbours by going left, right, up or down,
provided, of course, that there is a neighbouring room in the
corresponding direction.
The wazir, knowing that the prince is on his way, has set a time
bomb that will kill the princess after T seconds. You will
be given the position of the princess, the time left for the bomb to
go off and the time it takes for the prince to kill the guards in each
of the rooms in the dungeon. Your task is to determine if it is
possible for the prince to reach the princess and save her by defusing
the bomb before the T seconds expire.
For example, suppose the dungeon is described by the following
grid of numbers.
232
251
531
311
The number at position (i,j) indicates the time taken for
the prince to overpower the guards in room (i,j). Suppose the
princess is in the room at position (4,2). If T = 10. there
is no way the prince can reach the princess in time. However, if
T = 15, the prince can reach the princess with 4 seconds to
spare, as follows. Starting from (1,1), he moves right to (1,2) and
then (1,3), comes down all the way to (4,3) and then moves (4,2). This
takes 11 seconds (note that he must also overpower the guard in the
room where the princess is incarcerated). You can check that he cannot
reach the princess with more than 4 seconds to spare by any route.

SUCCESSFUL SUBMISSIONS
User

Time Mem

Lang

Solution

atish112

0.00 1.6M

View

iiit

0.00 1.7M

View

abhipaliwal

0.00 1.7M

View

karlheinz_jung

0.00 1.8M

View

smithinsu

0.00 1.8M

View

david70

0.00 2.6M

C++

View

aksmit

0.00 2.8M

C++ 4.3.2

View

codegambler

0.00 2.8M

C++ 4.3.2

View

jayesh02

0.00 12.4M

C++ 4.3.2

View

tl268

0.01 2.8M

C++ 4.3.2

View

zhujiaye

0.01 10.2M C++ 4.0.0-8

View

saurabhagg

0.02 2.6M

View

C++

1 of 7

HELP

Input
The first line contains two integers M and N indicating the number of rows and columns in the
rectangular dungeon. Lines 2,3,,M+1 contain N positive integers. The jth integer on line i+1 is the time
taken to overpower the guards at room (i,j). The last line in the input, line M+2, contains three integers a,
b and T, where (a,b) is the position of the cell where the princess is held and T is the amount of time
before the bomb goes off.

Output
If it is not possible for the prince to save the princess then print a single line with the answer NO.
Otherwise, print two lines. The first line should say YES. The second line should contain a single integer
indicating the maximum possible time to spare when the prince rescues the princess.

Constraints
You may assume that 1 N,M 70.

Example
Input:
43
232
251
531
311
4 2 15

converted by W eb2PDFConvert.com

Output:
YES
4
Author:

Program should read from standard input and write to

standard output. After you submit a solution you can see
your results by clicking on the [My Submissions] tab on
the problem page. Below are the possible results:

admin

Date Added: 28-07-2009

Time Limit:

1 sec

Source
Limit:

50000 Bytes

Accepted Your program ran successfully and

gave a correct answer. If there is a score for the
problem, this will be displayed in parenthesis next to
the checkmark.

ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.3.2, CPP 4.8.1, CPP11,
Languages: CS2, D, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM,
NICE, NODEJS, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2,
RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC

Time Limit Exceeded

Your program was
compiled successfully, but it didn't stop before time
limit. Try optimizing your approach.
Wrong Answer Your program compiled and ran
succesfully but the output did not match the expected
output.

Comments
Please login at the top to post a comment.

Runtime Error Your code compiled and ran but

encountered an error. The most common reasons are
using too much memory or dividing by zero. For the
specific error codes see the help section.

tomgcoleman @ 1 Aug 2009 03:29 PM

The variable names appear to be, um... variable. :)
In the constraints it suggests that K <= 70, maybe that is the time alloted (T)? In another place the
time is referred to as M.
This is an enjoyable coding challenge, please clean up the variables.

Compilation Error
Your code was unable to
compile. When you see this icon, click on it for more
information.
If you are still having problems, see a sample solution
here.

admin 2 @ 1 Aug 2009 07:45 PM

This is fixed :)

TheSadReaper @ 10 Sep 2009 01:17 AM

In the sample case input,if T=11s,should the output be YES 0 or NO

TheSadReaper @ 10 Sep 2009 01:27 AM

Sorry for double posting.
My program is running successfully for any input cases i tried but it does not seem to be working
here.
Can anyone tell me what a possible corner case might be.
Also,as given in the problem,the array indexing starts from 1,is it possible that the array indexing in
the test cases start from 0.

ajaycilly @ 25 Oct 2009 04:24 PM

I can still see the Constraint as:
You may assume that 1 N,K 70.
But admin says it's fixed.
Please tell me what whould we 'assume' in place of K

CodeChef is a non-commercial competitive programming community

About CodeChef

About Directi CEO's Corner C-Programming Programming Languages Contact Us

2009 Directi Group. All Rights Reserved. CodeChef uses SPOJ by Sphere Research Labs
In order to report copyright violations of any kind, send in an email to copyright@codechef.com

The time now is: 01:17:15 PM

Your Ip: 184.173.139.19

CodeChef - A Platform for Aspiring Programmers

CodeChef was created as a platform to help programmers make it big in the world of algorithms, computer programming and programming contests. At CodeChef we work hard to
revive the geek in you by hosting a programming contest at the start of the month and another smaller programming challenge in the middle of the month. We also aim to have
training sessions and discussions related to algorithms, binary search, technicalities like array size and the likes. Apart from providing a platform for programming competitions,
CodeChef also has various algorithm tutorials and forum discussions to help those who are new to the world of computer programming.

Practice Section - A Place to hone your 'Computer Programming Skills'

Try your hand at one of our many practice problems and submit your solution in a language of your choice. Our programming contest judge accepts solutions in over 35+
programming languages. Preparing for coding contests were never this much fun! Receive points, and move up through the CodeChef ranks. Use our practice section to better
converted by W eb2PDFConvert.com

prepare yourself for the multiple programming challenges that take place through-out the month on CodeChef.

Compete - Monthly Programming Contests and Cook-offs

Here is where you can show off your computer programming skills. Take part in our 10 day long monthly coding contest and the shorter format Cook-off coding contest. Put yourself
up for recognition and win great prizes. Our programming contests have prizes worth up to Rs.20,000 and $700lots more CodeChef goodies up for grabs.

Discuss
Are you new to computer programming? Do you need help with algorithms? Then be a part of CodeChef's Forums and interact with all our programmers - they love helping out other
programmers and sharing their ideas. Have discussions around binary search, array size, branch-and-bound, Dijkstra's algorithm, Encryption algorithm and more by visiting the
CodeChef Forums and Wiki section.

CodeChef Community
As part of our Educational initiative, we give institutes the opportunity to associate with CodeChef in the form of Campus Chapters. Hosting online programming competitions is not
the only feature on CodeChef. You can also host a coding contest for your institute on CodeChef, organize an algorithm event and be a guest author on our blog.

Go For Gold
The Go for Gold Initiative was launched about a year after CodeChef was incepted, to help prepare Indian students for the ACM ICPC World Finals competition. In the run up to the
ACM ICPC competition, the Go for Gold initiative uses CodeChef as a platform to train students for the ACM ICPC competition via multiple warm up contests. As an added incentive the
Go for Gold initiative is also offering over Rs.8 lacs to the Indian team that beats the 29th position at the ACM ICPC world finals. Find out more about the Go for Gold and the ACM ICPC
competition here.

converted by W eb2PDFConvert.com