Сработало

Your forgot to say something about the score distribution :)

This famous sentence in Codeforces community: Score distribution will be announced later.

Good Luck.

Such a significant round without T-Shirts? How real is this? :)

Why not codeforces round (1<<8) :[

I hope, for all this anniversary round.

What does this even mean?

It's very SPECIAL round! next 2^x 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?

Give T-shirts to top 256 contestants who are not unrated ?

Again, please take the time to write a meaningful editorial.

Надо же, как я удачно потерял в прошлом раунде 2 очка (1701->1699) теперь раунд будет рейтинговым))

Oh... A codeforces round by a BUG MAN (oversolver)
God bless us... :D

Please don't make the pretests too strong so that hacking is possible .

It's a special Round. I think it will be an interesting round.

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...

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 :)

Since this round is sharply before the "NOI" Contest in China, some use their minor account to participate in this round>_<

А как размещены задачи в раунде? Они идут по возрастанию сложности или случайным образом?

hope an easy contest ! :)

Top 20 this time around. No doubt about that.

From my experience I'm not lucky in dynamic score :(

More than 4000 people have registered! Isn't this the highest till date?

Я конечно все понимаю, но этого я не понимаю! Хреновая какая-то динамичная разбалловка получилась...

500 — 500 — 2000 — 2000 — 3000

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 :)

Напишите пожалуйста кто-как решал C(Div 2)?

The pretests for the suffix question were too strong ! Not even a single hack

in D, shouldn't the problem ask for the k-th smallest number (not k-th largest)?

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.

Мой решение задачи В не прошло шестой тест. Можете дать тест

there was a ghost in the 5th pretest of B! what is the solution of B???

No spoiler but please give some idea about intended solution for C and D.

can anybody please explain how to solve D.. thanks

Has anyone see someone hack problem B ? i didn't see a single one

thanks for the fast system tests

I am happy to know that B's points became 1000 rather than only 500

Финальное тестирование за 2 минуты!Почаще бы так!

Changing Score is unfair!!

First time in top 20 ;)

Добавил в Д для спокойствия иф с выводом ответа, а он оказался не правильным))

Найдите 10 отличий!

Вот в этой комнате, между вот этими кодами:

1. 7127854 && 7136545

2. 7124532 && 7137613

3. 7133054 && 7132985

Бонус: Можете насладится чрезвычайно интересными взломами задач А и B этого же участника. Это же надо такие тупые баги в коде допускать по типу "if(n==15) cout<<"NO";"

Серьезно???Никто ничего не сделал, и рейтинг обновили как положено....

Simple round but I messed it up big time!

Why hasn't the new rating been updated yet?

Буква Т-Тормоз: правильно придумал решение C, но затупил в реализации, поставив ноль в неправильном месте. Контест хороший, задачи были интересные.

.....So unlucky.....The "Verdict" is "skipped"....The all..

In problem B I was printing "automation" instead of "automaton". I was not able to debug this during contest :(

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.

As usual, Country wise standings here [Unofficial participants not included]. Hugs and Bugs here.

Please make the pretests more comprehensive i.e introduce at least 10 pretests.

whats wrong with test case 36: boosss osos output is: both

test 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.

Why my problem B only submitted once and pretest passed, but my submission was skipped?

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

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."

Edit: I wanted to comment this in round 257