Rezwan.Arefin01's blog

By Rezwan.Arefin01, history, 2 years ago, In English,

Bangladesh Informatics Olympiad 2016 took place in 24th December, 2015.
The problems are now added in GYM — Bangladesh Olympiad in Informatics 2016 by rubabredWAn The problems are pretty interesting. Those who are preparing for IOI should give a try.
If interested the standings of the main contest can be found here — BdOI 2016 Standings

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

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Problem B is pretty nice, albeit fairly easy. I remember seeing Problem C on an old COCI, like 2006/2007 or so. Thanks rubabredWAn for taking the time to put the contest on Codeforces, it's interesting to see what other countries' olympiads look like. Is this the olympiad that chooses the IOI team?

  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This contest was a primary selection for the national camp. Team members were selected by the performance of the camp.

»
2 years ago, # |
Rev. 3   Vote: I like it +10 Vote: I do not like it

Unfortunately, I don't see any bounds for joy values on E :(

Also, F is a version of this problem with lower bounds.

»
2 years ago, # |
  Vote: I like it +5 Vote: I do not like it

i can't figure out solution of problem C.can someone give hints.

  • »
    »
    2 years ago, # ^ |
    Rev. 2   Vote: I like it +1 Vote: I do not like it

    dp[i][j] — how many permutations with elements from 1 to i have exactly j inversions.

    The answer is .

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is editorial going to be published?

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

A memory limit of 32 MB on Problem E. Is there any specific reason for doing so ? I have a NlogN solution (time and memory), but it just fails to fit into the memory limits.

»
23 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can Problem D be solved using greedy by picking the best point every time? I keep getting wrong answer not sure if it can be solved in such a way or do I have a mistake in code. My code: https://ideone.com/NkRObU

  • »
    »
    23 months ago, # ^ |
    Rev. 2   Vote: I like it +1 Vote: I do not like it

    I assume it is ideally meant to be a DP problem that can be solved only this way. The fact that K is as small as 50 gives a good hint, doesn't it ?

»
11 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Any hints for problem E???

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

implementing a deque in problem a causes TLE in test 5. what can i do?