11561 - Getting Gold

[mukit]

Hi, I'm getting W.A in this problem. Please give some I/O.

Code: Select all

Cut ...

Thank's in advance.

[emotional blind]

Code: Select all

               if(maze[i-1][j]=='T' || maze[i][j-1]=='T' || maze[i+1][j]=='T' || maze[i][j+1]=='T')
               {
                  maze[i][j] = 0;
               } 

Probably you are pointing out of maze..

[mukit]

Could you please explain ?
I started value of i and j from 1.

[emotional blind]

Do you think maze[i+1][j] is always indexing within your maze?
When i = n, then it is indexing maze[n+1][j], but your maze is [1][1] to [n][m], right?

[mukit]

but my maze size is 53 (maze[53][53]) larger than given limit (3 to 50). First I set all element of maze to 0 (using memset).
So when maze[i+1][j] is called, this dosen't exceed maze. Could please explain ?

[emotional blind]

Code: Select all

      else if(maze[i][j-1]=='L')
      {
         _count++;

Is this correct?

[mukit]

sorry, i don't understand.
Here I indicated 'L' as the position where there is a gold beside a trap.
So, after getting gold it increments it's counter and return's back to avoid trap.

[mukit]

whatever, I updated my code using scanf instead of cin. But still WA. Someone please give some I/O.

Code: Select all

Cut ...

Thank's in advance.

[emotional blind]

Consider this case

Code: Select all

4 4
####
#TP#
#GG#
####

Output should be 0(zero).

[mukit]

Thank's a lot emotional blind. That was the case I caught.
Now rank 12 in this problem.

[emotional blind]

have fun and keep posting

[Obaida]

Some one please help me I got WA!!!!

Code: Select all

removed

[Jan]

Try the cases.

Input:

Code: Select all

8 4
########
#.T.TGT#
#.G..P.#
########
7 8
#######
#P...T#
#...G.#
#G.T..#
#.....#
#G..T.#
#.....#
#######

Output:

Code: Select all

1
2

Hope these help.

[Obaida]

I edited my code, but still WA!!!!

Code: Select all

removed

[Jan]

Try the case.

Input:

Code: Select all

6 5
######
#TG..#
#TG.G#
#TGPG#
######

Output:

Code: Select all

5