__Joker's blog

By __Joker, history, 3 years ago, In English

Please find my solution at : http://codeforces.com/contest/1054/submission/44512450

The algorithm I am following is this,

for each student, find out how many student have more chocolates than him, by adding l[i] and r[i].

This basically gives the standard competition ranking. see[1].

Next step is I am simply verifying if the ranking I am getting is a standard competition ranking.

And chocolate distribution is (n-rank[i])

My solution is failing on test case 6. And I am not able to download the whole test case( it is big).

Any body will be kind enough to point out what I am doing wrong ?

[1]. https://en.wikipedia.org/wiki/Ranking#Standard_competition_ranking_(%221224%22_ranking)

Read more »

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

By __Joker, 9 years ago, In English
 
 
 
 
  • Vote: I like it
  • -7
  • Vote: I do not like it

By __Joker, 9 years ago, In English

One of my submission was judged as "Memory limit exceeded". I am generally curious about how the online judge calculated the memory usage for a submission.

Read more »

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