OJ Board

you can try this... this may help you.... your ans is : my ans is :

Though its not a good case but still it proves your code wrong....check it out.......:p

• 1
  .#..AA..
  .##.AA#.
  ........
  .CCBB...
  .CCBB#..
  #.......
  ..DD....
  ..DD....

your output

• Case 1: 2315

ans is :

• Case 1: 2314

@ : crip121

let, there are 4 jobs


Job no. number of unit
J1 3
J2 4
J3 5
J4 4

If you find the total number of ways for each Job. Then you can easily find the Total number of Ways for all jobs by multiplying the number of ways of each job.

Now,
i) We need to complete J1 first, So keep one Unit ...

When my concept was clear about the problem i understood that it is not a hard problem but the code would be large enough. Then start coding and after finishing code I found lots of Bugs. After fixing those bugs I got Accepted in 1st submission (0.064 sec).

I understood that in this problem I have to run BFS from all alien and generate a new graph....then using MST I can come up with the ANSWER. But in this method there is a problem arise nd I don't understand how can i fix it.

i described the problem with this pic bellow:

http://www.maam.99k.org ...