Search found 383 matches

by emotional blind
Sun Apr 18, 2010 6:56 am
Forum: Volume 117 (11700-11799)
Topic: 11773 - King's Wish
Replies: 9
Views: 3123

Re: 11773 - King's Wish

orfest wrote:Is 3 20 correct answer for test case 60?
No, I think right answer is 4 30
by emotional blind
Sun Apr 18, 2010 6:45 am
Forum: Volume 117 (11700-11799)
Topic: 11773 - King's Wish
Replies: 9
Views: 3123

Re: 11773 - King's Wish

can '9 1' cover a square smaller than 18x18? Yes, it can cover, 9 x 9 right, i was aware of it. but for '9 1' i guess 9x9 is not the problem wants because '9 1' covers a length of the square. the problem says '2 1' is valid for 4x4. while if '9 1' is valid for 9x9, '2 1' cannot be valid for 4x4, si...
by emotional blind
Sat Apr 17, 2010 6:44 pm
Forum: Volume 117 (11700-11799)
Topic: 11773 - King's Wish
Replies: 9
Views: 3123

Re: 11773 - King's Wish

nealzane wrote:can '9 1' cover a square smaller than 18x18?
Yes, it can cover, 9 x 9
by emotional blind
Fri Sep 18, 2009 3:52 pm
Forum: Volume 116 (11600-11699)
Topic: 11643 - Knight Tour
Replies: 12
Views: 3004

Re: 11643 - Knight Tour

mak(cse_DU) wrote:Actually judge data set was wrong.
They missed this case.

One particular case or one critical case is not covered by judge data does not imply that judge data set is wrong. I should admit that judge data could have been stronger, but I merely believe data is correct.
by emotional blind
Fri Jul 31, 2009 9:18 pm
Forum: Volume 116 (11600-11699)
Topic: 11609 - Teams
Replies: 11
Views: 5253

Re: 11609 - Teams

The first line of the input represents the number of cases in the input.
by emotional blind
Thu Feb 12, 2009 7:37 pm
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 22449

Re: 10130 - SuperSales

What are the other changes?
by emotional blind
Thu Feb 12, 2009 1:00 pm
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 22449

Re: 10130 - SuperSales

Code: Select all

   if(memo[n][wa]!=-1)return memo[n][wa];
   if(n<0 || wa<=0)return 0;
This two lines should be swapped.
by emotional blind
Tue Dec 23, 2008 7:36 pm
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 9571

Re: 11561 - Getting Gold

have fun and keep posting :)
by emotional blind
Tue Dec 23, 2008 3:13 pm
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 9571

Re: 11561 - Getting Gold

Consider this case

Code: Select all

4 4
####
#TP#
#GG#
####
Output should be 0(zero).
by emotional blind
Mon Dec 22, 2008 9:08 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 9571

Re: 11561 - Getting Gold

Code: Select all

      else if(maze[i][j-1]=='L')
      {
         _count++;
Is this correct?
by emotional blind
Mon Dec 22, 2008 8:42 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 9571

Re: 11561 - Getting Gold

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?
by emotional blind
Mon Dec 22, 2008 8:22 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 9571

Re: 11561 - Getting Gold

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..
by emotional blind
Sun Nov 16, 2008 12:33 pm
Forum: Volume 115 (11500-11599)
Topic: 11546 - Olympic Swimming
Replies: 6
Views: 1182

Re: 11546 Olympic Swimming

Hashing is one of the approaches for this problem.
by emotional blind
Fri Oct 24, 2008 4:28 am
Forum: Volume 115 (11500-11599)
Topic: 11531 - Solve the Broken Maze
Replies: 15
Views: 6524

Re: 11531 - Solve the Broken Maze

Try the easier version of this problem.

https://www.spoj.pl/problems/MAZE/
by emotional blind
Wed Oct 22, 2008 7:26 am
Forum: Volume 115 (11500-11599)
Topic: 11531 - Solve the Broken Maze
Replies: 15
Views: 6524

Re: 11531 - Solve the Broken Maze

LayCurse wrote:I cannnot solve this problem correctly too.
I have no idea..., can anyone give me some advice? TIA :)

The idea is DP. Did you try with DP?

Go to advanced search