### Bugman's blog

By Bugman, 7 years ago, translation,

Hello, CodeForces community! I'm happy to tell you about upcoming 256-th round, which will be held for the participants from second division. Participants from first division can take part out of the competition.

I hope, for all this anniversary round. For me it is the first round in which I am the author, in this I will be glad to see everyone. Want to say thanks Gerald for help with preparing contest, Delinur for translating, and of course MikeMirzayanov for CodeForces project.

I am from Krasnoyarsk, and the hero of tasks will be our team talisman Bizon-the-Champion. Hope you like to spend time with him :) See you and good luck!

UPD. Few hours before the start. Score distribution will be dynamic (see more information here)

UPD. Round is over! You can find editorial here.

• +138

 » 7 years ago, # |   +3 Your forgot to say something about the score distribution :) This famous sentence in Codeforces community: Score distribution will be announced later.Good Luck.
 » 7 years ago, # |   0 Such a significant round without T-Shirts? How real is this? :)
•  » » 7 years ago, # ^ | ← Rev. 2 →   0 i think it would be a good idea to give out T-shirts to the top 256 contestants. but then again, this is a Div-2 only round. so it might result in too many unrated users taking these places. not what we want to see.
•  » » » 7 years ago, # ^ | ← Rev. 3 →   -14 Deleted.
•  » » » » 7 years ago, # ^ |   +11 T-shirts in div-2 round? RLY?
•  » » » » » 7 years ago, # ^ |   -52 ah, just wanted to leave this guy here :)
•  » » » » » » 7 years ago, # ^ |   +6 alright, no more stupid pictures, sorry.
•  » » 7 years ago, # ^ |   -13 I dont understand. Do they gift t-shirts? Plz give more info to me.
•  » » » 7 years ago, # ^ |   +1 They gave t-shirts at Codeforces Round #100 to the top 100 contestants. In fact, there were two participants at the 100th place)
•  » » » » 7 years ago, # ^ |   0 Ok. Thanks for info. Actually I had thought that they give shirts for every round, like codechef.com. I just asked a question. Why have i got -9 above?
•  » » » » » 7 years ago, # ^ |   +7 Do not try to understand logic of voting in codeforces)))
•  » » » » » » 7 years ago, # ^ |   -35
 » 7 years ago, # |   +7 Why not codeforces round (1<<8) :[
•  » » 7 years ago, # ^ |   -8 i had suggested this earlier. since my first "wish" was granted, i thought the second one would be too. but it seems not so. :(
 » 7 years ago, # |   -8 I hope, for all this anniversary round.What does this even mean?
 » 7 years ago, # | ← Rev. 7 →   +68 It's very SPECIAL round! next 2x round will be 256 contests later, it means 256 * 4 = 1024 days, ~3 years! UPDATE: It's last 2^2^2^2^2... round you will ever seen in your life :( next such round will be 65280 round later, it means 65280 * 4 = 261120 days later, ~800 years. still no T-shirts?
•  » » 7 years ago, # ^ |   0 A slight mistake: last ((((2^2)^2)^2)^2)... round
•  » » » 7 years ago, # ^ |   0 basically, the last 22x round.
•  » » » » 7 years ago, # ^ |   +5 :) 1 << (2 << 2)
•  » » » » » 7 years ago, # ^ |   0 i actually meant 224 (i.e. 1 << (1 << 4)), but u are also right.
 » 7 years ago, # |   -22 Give T-shirts to top 256 contestants who are not unrated ?
•  » » 7 years ago, # ^ |   -29 Good Idea.
•  » » » 7 years ago, # ^ |   -10 Ok not good. i hav understood. Because the div 1 group has better people and deserve "more".
•  » » » » 7 years ago, # ^ |   -8 Lol. Chill man. You don't have to respond according to the number of upvotes/downvotes your post gets.
 » 7 years ago, # |   +11 Again, please take the time to write a meaningful editorial.
•  » » 7 years ago, # ^ |   -7 hard contest
 » 7 years ago, # | ← Rev. 3 →   -30 Oh... A codeforces round by a BUG MAN (Bugman) God bless us... :D
•  » » 7 years ago, # ^ |   +6
•  » » » 7 years ago, # ^ | ← Rev. 2 →   -21
 » 7 years ago, # |   +2 Please don't make the pretests too strong so that hacking is possible .
•  » » 7 years ago, # ^ |   0 Also don't make too easy...
 » 7 years ago, # |   0 It's a special Round. I think it will be an interesting round.
•  » » 7 years ago, # ^ |   -17 You really mean the round is interesting?
 » 7 years ago, # |   -43 To be honest I was gray for nearly two months.Really upset story... So I just want to be unrated again and see if I can rise up from this new beginnig...
•  » » 7 years ago, # ^ |   0 LOL...And see if you can get the T-shirt for #256 unrated?
•  » » 7 years ago, # ^ |   +1 You mustn't create more than one account. See Help.
•  » » » 7 years ago, # ^ |   +2 Yeah,you are right. I am so sorry to the whole CF community. I will turn to that original account :) though it has been gray for more than one month :P
•  » » » » 7 years ago, # ^ |   0 You participated in the round with this fake account . This account should be banned !
 » 7 years ago, # |   0 What happened to CodeForces ? Why the rounds are not beginning from 19.30 ? :( Why all the contests are starting from 18:00, 17:00.. 19:30 was good :)
•  » » 7 years ago, # ^ |   0 For some eastern countries 19:30 is not comfortable, because contest ends too late. However I would like 19:30, too)
 » 7 years ago, # |   0 Since this round is sharply before the "NOI" Contest in China, some use their minor account to participate in this round>_<
•  » » 7 years ago, # ^ |   0 What's minor account?
•  » » » 7 years ago, # ^ |   0 I think he means it has less priority to participate
 » 7 years ago, # |   +1 hope an easy contest ! :)
 » 7 years ago, # |   0 Top 20 this time around. No doubt about that.
 » 7 years ago, # |   0 From my experience I'm not lucky in dynamic score :(
 » 7 years ago, # |   0 More than 4000 people have registered! Isn't this the highest till date?
•  » » 7 years ago, # ^ |   +7 Bang! Not exactly. A more ' popular' one is Zepto Code Rush which 4663 participants took part in :)
 » 7 years ago, # |   +11 Very interesting problems which cover a lot of fields! And it seems that if you think deeply, you' ll get AC. What a pity that I waste too much time on D( and can' t ensure I' m right) which means can' t think over C and E :)
 » 7 years ago, # |   0 The pretests for the suffix question were too strong ! Not even a single hack
•  » » 7 years ago, # ^ |   0 Not exactly.1815 Pretest Passed1449 Accepted
 » 7 years ago, # |   +24 in D, shouldn't the problem ask for the k-th smallest number (not k-th largest)?
•  » » 7 years ago, # ^ | ← Rev. 2 →   -13 Oops! My bad!
•  » » » 7 years ago, # ^ |   +4 Not actually...1 2 3 4 5 What is the second largest and second smallest value of above sequence ?
•  » » 7 years ago, # ^ |   0 agreed.:D
•  » » 7 years ago, # ^ |   0 Yeah I was pretty confused for a while.
 » 7 years ago, # |   0 Is it possible to solve C with segment tree? This was my idea:Find the minvalue of the segment [1-N] and number of elements which are equal to minvalue, lets call it mincount. If, minvalue is smaller than mincount, it is better to brush horizontally. That way we remove mincount of numbers for only minvalue cost. Otherwise, better to do vertical brush.If we are successful with horizontal brush, then we subtract minvalue from the segment. After that, some elements will be come 0. We the split the segment over the positions of 0 and repeat for the above for each new segment created.So, perhaps doing this greedy was wrong? I got WA of Pretest 4.
•  » » 7 years ago, # ^ |   +6 your implementation might have some issues, the greedy strategy is fine :)
•  » » 7 years ago, # ^ | ← Rev. 2 →   0 I did exactly the same and it passed pretests. By the way, it can be done (and it's easier this way) without segment trees.One my friend got WA4 because he didn't repeat the procedure for the rightmost segment created if its right coordinate was equal to the original segment's right coordinate.
•  » » 7 years ago, # ^ |   0 Seems like my assumption for using horizontal stroke only when minvalue <= mincount is wrong. Apparently, res = min ( using horizontal brush even when minvalue > mincount, using vertical brush ).
 » 7 years ago, # |   0 there was a ghost in the 5th pretest of B! what is the solution of B???
•  » » 7 years ago, # ^ |   0 Check your "automaton" case.
•  » » » 7 years ago, # ^ |   0 if(a.find(b)!=string::npos) -> automation !!!! wasn't it enough? what is the result of "a" and "a" ? my code tells me array :( i think that's my bug, is it?
•  » » » » 7 years ago, # ^ |   0 abcde abde Answer is automation.
•  » » » » 7 years ago, # ^ | ← Rev. 2 →   0 The problem statement states that Words s and t are different 
•  » » 7 years ago, # ^ |   0 i agree.
•  » » » 7 years ago, # ^ |   0 the main keyword was "only". I missed it for a long time and lost important time and points :(
 » 7 years ago, # |   0 No spoiler but please give some idea about intended solution for C and D.
•  » » 7 years ago, # ^ |   +9 d — binsearch
•  » » » 7 years ago, # ^ |   0 so, we must generated first the value of each element in multiplication table? can you elaborate more? thanks.
•  » » 7 years ago, # ^ |   0 For D my solution is simple... I tried to devide the whole map into three right triangles, and sort all the numbers between two adjacent triangles...　Well it' s a little bit complex to explain the progress( and can' t make sure that it' s correct)
•  » » » 7 years ago, # ^ |   0 can you give me the code? just paste it into pastebin.com, and give the link.thanks.
•  » » » » 7 years ago, # ^ |   0 According to the system test my solution is wrong so... :(
 » 7 years ago, # |   0 can anybody please explain how to solve D.. thanks
•  » » 7 years ago, # ^ | ← Rev. 2 →   +7 General idea is binary search. You need to guess what whether a number X is the kth smallest number in the multiplication table. Hence, you need to count the total number of elements in the multiplication table which is smaller or equals to X. On the first row, there are min(X, M) numbers which are less than or equals to X. On the second row , there are min(X/2, M) numbers which are less than or equals to X. Generally, on row i, there are min(X/i, M) numbers less than or equals to X. Compute this number for every row to find out the total number of elements smaller than X. With the above calculation, we conduct binary search from 1 to 500000^2 to find the first number which has k numbers smaller than or equals to it.Something like 7137779
•  » » » 7 years ago, # ^ |   0 Thanks! That' s clear enough! :)
•  » » » 7 years ago, # ^ | ← Rev. 2 →   0 sorry iamnoobi, but i don't get it yet... what is X and M here? and i also confuse with the loop macro pattern in FOR(i, 1, n+1)
•  » » » » 7 years ago, # ^ |   0 X is the number that you are guessing as the k-th number, m is the number of columns. The macro means iterate from 1 to n.
•  » » » 7 years ago, # ^ |   0 Thank you, that's a great explanation!
•  » » » 5 years ago, # ^ |   0 can't understand why they are all distinct numbers when u count number of smaller elements than X.
•  » » 7 years ago, # ^ |   0 This problem is a classic problem . It's called Young tableau , you can search it on the internet :)
•  » » » 7 years ago, # ^ |   0 I googled but could not get how this is Young tableau. Would you explain Snarl_jsb?
 » 7 years ago, # | ← Rev. 2 →   0 Has anyone see someone hack problem B ? i didn't see a single one
•  » » 7 years ago, # ^ |   +1
•  » » » 7 years ago, # ^ |   0 404 not found.
•  » » 7 years ago, # ^ |   0 DmitriyH will post the statistics for the round soon. We will be able to see how many B solutions were hacked there.
 » 7 years ago, # |   0 thanks for the fast system tests I am happy to know that B's points became 1000 rather than only 500
 » 7 years ago, # |   0 Changing Score is unfair!!
•  » » 7 years ago, # ^ |   +9 This is dynamic score distribution. :)
•  » » 7 years ago, # ^ | ← Rev. 2 →   0 You can see this blog if you want to know details about Dynamic Score Distribution. :)
 » 7 years ago, # |   +2 First time in top 20 ;)
 » 7 years ago, # |   +1 Simple round but I messed it up big time!
 » 7 years ago, # | ← Rev. 2 →   +2 Why hasn't the new rating been updated yet?
•  » » 7 years ago, # ^ |   0 be patient. it usually takes about half hour after system testing finishes.
 » 7 years ago, # |   -8 .....So unlucky.....The "Verdict" is "skipped"....The all..
•  » » 7 years ago, # ^ |   0 why the verdict is skipped?
•  » » » 7 years ago, # ^ |   0 It should happen when you submit the correct program more than one time. But I only submit one copy of problem A.....ToT
•  » » 7 years ago, # ^ |   +11 Did you copy and submit someone else's code?Admins will change a user's all submission to skipped if the user cheated in the contest.
•  » » » 7 years ago, # ^ | ← Rev. 3 →   -8 ……
 » 7 years ago, # |   0 In problem B I was printing "automation" instead of "automaton". I was not able to debug this during contest :(
•  » » 7 years ago, # ^ |   0 What a pity...
•  » » » 7 years ago, # ^ |   0 it happens because of lack of practice..
•  » » » » 7 years ago, # ^ |   +11 Next time try Ctrl+C and Ctrl+V. It really helps :)
 » 7 years ago, # |   -7 kindly improve your test cases for PRETESTS. For problem a(that was the easiest problem) i did a blunder still pretests passed. Look at the last line of this code. if(cup%5==0) s1=cup/5; else if(cup%5!=0) s1=cup/5 + 1; if(med%10==0) s2=med/10; else if(med%10!=0) s2=cup/10 + 1;s2=cup/10 + 1; i was supposed to write s2=med/10 + 1; but in hurry i did this blunder. MAIN concern is that this code PASSED all PRETESTS. I think this is harsh. I know my mistake. But still this is really very harsh.
•  » » 7 years ago, # ^ |   0 since this didn't pass the system tests, you can't really complain too much. PS: this happens, don't get demotivated. u found ur mistake, that's the most important thing. :)
 » 7 years ago, # | ← Rev. 2 →   +2 As usual, Country wise standings here [Unofficial participants not included]. Hugs and Bugs here.
•  » » 7 years ago, # ^ |   +3 Thank you! I was waiting this)
 » 7 years ago, # |   -9 Please make the pretests more comprehensive i.e introduce at least 10 pretests.
 » 7 years ago, # |   0 great contest but i don`t participate in his
 » 7 years ago, # | ← Rev. 4 →   0 whats wrong with test case 36: boosss osos output is: bothtest case 5: abacaba aaaa output is: automaton i think in test case 5: answer should be "both" instead of automaton my submission id is 7141893 plz correct me if i am wrong.
•  » » 7 years ago, # ^ |   0 By applying Automaton you can delete a single char. Now if we apply automaton on abacaba 3 times and delete b,c,b the resulting string will be aaaa. So by applying only automaton we can transform abacaba to aaaa.
•  » » » 7 years ago, # ^ |   0 so we need to be check first for automaton then for both am i ryt ?
 » 7 years ago, # |   0 Why my problem B only submitted once and pretest passed, but my submission was skipped?
•  » » 7 years ago, # ^ |   0 In this case,I guess that there are two situations. The first,the system was wrong that time.The second,you had used more than one accounts to solve this problem. Of course,it is possible that there are many other causes. Above all is what was said by a god cow.
 » 7 years ago, # |   0 I receive a TLE from my D solution. I have no idea how to make it better. Who can help me on the problem? My submission in the match: 7137602 I improved it later, but still TLE 7138146
•  » » 7 years ago, # ^ |   +1 Oh, I have realized there is something wrong in my binarysearch, which leads to an endless iteration.
 » 7 years ago, # |   -8 There are a lot of unrated participants in the top of the rank list again ! I think codeforces must have some rules like this : "Unrated persons cant take part in Div2 only contests."
 » 7 years ago, # | ← Rev. 2 →   -8 Edit: I wanted to comment this in round 257