Timsei's blog

By Timsei, history, 8 days ago, In English,

As the title says, my KM gets TLE on the UOJ.So I'm very doubted about the problem.So will there be someone to help me solve the problem? KM is an algorithm that solves the weighted bipartite graph maximum matching problem.

The Problem is the following one :http://uoj.ac/problem/80?locale=en

 
 
 
 
  • Vote: I like it  
  • +21
  • Vote: I do not like it  

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

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

»
8 days ago, # |
  Vote: I like it +5 Vote: I do not like it

Is there any one to help me?I'll be grateful.

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

How great Timsei he is!

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

Have you optimized it by using slack?

  • »
    »
    7 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes, I've done that.But I still get TLE in UOJ.

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

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