You are not logged in. Please login at www.codechef.com to post your questions!

×

tester's solution of KMHAMHA.

Hello everyone. I was going through the solution of the tester of the problem of kamehameha. I understood the hashing part but the part i could not understood is the augment function. I mean yeah i have a rough idea what it does but i could not figure out the how that function is able to take care of the various constraints imposed in the original algo of Hopcroft–Karp algorithm( if at all this is the algo implemented here and if not please can you tell me which algo is this). Also i was wondering about the complexity of the solution. At first look it seems like O(VE) solution but the original algo is 0(sqrt(V)*E). Solution can be found here. Any help would be appreciated. Thanks

asked 24 Dec '13, 01:31

paramvi's gravatar image

3★paramvi
165
accept rate: 0%

edited 24 Dec '13, 02:09

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×101
×86
×12
×4

question asked: 24 Dec '13, 01:31

question was seen: 784 times

last updated: 24 Dec '13, 02:09