ManikantanV's blog

By ManikantanV, history, 3 years ago, In English

Hi all,

I noticed today by accident that opening Codeforces in HTTP does not result in HTTPS redirection. It'd be great if this can be fixed since Codeforces handles data like login credentials

Read more »

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

By ManikantanV, history, 5 years ago, In English

Hi,

I tried to solve the problem by creating a 10 — character hash code for every pokemon for every gym in which it appears and then appending all hash codes for every type of pokemon.

The hash code format is : Gym Number(padded to 5 digits) + Number of occurrences in given gym(padded to 5 digits)

I decided on 5 digits for each part since max. value is 100000, which can be rolled back to 00000.

The hash codes are entered into a trie for processing. The trie is implemented using node pointer with 10 child nodes, representing each of the digits.

The expected memory complexity of my solution is — O(Total number of pokemons * 10)

Since total number of pokemons is at max 5*10^5 , memory used is at most around 5 * 10^6.

Is this a large enough memory consumption to cause runtime error?

Thanks in advance

Read more »

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

By ManikantanV, history, 6 years ago, In English

Is there a way to check list of users who have added me as friend in Codeforces?

Read more »

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

By ManikantanV, 7 years ago, In English

Hi! I am unable to detect the bug in my code problem "Ilya and sticks". I have covered separate cases for number of sticks (>=4,=3,=2,=1). Help is appreciated.Thanks

Code link:

Read more »

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

By ManikantanV, 7 years ago, In English

Problem Link:

Won't the arrangement of books depend on the number of times each book is read? The book which has been read maximum number of times ought to lie closer to the top. Can someone explain how the author's approach yields optimal solution and not my line of thinking?

Read more »

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

By ManikantanV, 7 years ago, In English

I am trying Problem B "Om Nom and Spiders" in the Zepto Code Rush 2014. I am repeatedly getting runtime errors in judgement. However, test cases seem to work just fine in Ideone! Help will be appreciated

Submission No is 8896071

Read more »

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