hemant_dhanuka's blog

By hemant_dhanuka, history, 5 weeks ago, In English,

Hi,I am trying to solve this problem on Spoj.

I have implemented simple Dinic's algorithm using java,but am getting TLE.Here is the link solution .
Am I doing anything wrong?

Please help!!

 
 
 
 
  • Vote: I like it  
  • -4
  • Vote: I do not like it  

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

Auto comment: topic has been updated by hemant_dhanuka (previous revision, new revision, compare).

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

Make your graph using an adjacency list instead of an n by n adjacency matrix.

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Lol. You don't even know how to code an ajacency list and you want to solve max flow problem? That's funny.