madlad's blog

By madlad, history, 11 months ago, In English,

I was trying to solve this problem: https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1402

I used simple BFS to solve the problem but I am getting WA.

My code: https://ideone.com/ljuSH7

There are no test cases for this on uDebug too and I am struggling to find out where I went wrong.

I just calculated the min time = time needed to complete all the jobs that need to be completed before 'x' and the max time = Total time — the time needed to complete all the jobs that require 'x' to be completed first and then I just calculated the difference of it.

Can someone help me?

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Anyone?

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Your idea is correct, there must be something wrong in implementation.

I am sharing link to my code. Here I have used two graphs, one for min_time and one for max_time.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

If anyone solved this problem.Please post if any corer cases?

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Done :) Many negative answers :(