Привет сообществу CodeForces! Рад сообщить о предстоящем 256-м раунде, который пройдёт для представителей второго дивизиона. Представители первого дивизиона смогут поучаствовать вне конкурса.
Надеюсь, для всех это юбилейный раунд. Для меня же это первый раунд, в котором я являюсь автором, по-этому я буду рад видеть всех. Хочу поблагодарить Gerald'а, который помог с подготовкой контеста, Delinur за перевод условий, и конечно MikeMirzayanov за сам проект CodeForces.
Я сам из Красноярска, а героем задач будет наш незаменимый командный талисман Бизон-Чемпион. Надеюсь, вам понравится провести с ним время:) До встречи и удачи!
UPD. До начала соревнования осталось несколько часов. Стоимость задач будет динамической (подробнее об этом можно почитать здесь).
UPD. Раунд завершился, разбор можно прочитать здесь.
Сработало
Я не понимаю, как это связано с раундом или с автором?
ну типа его комментарий от том что нужно будет в будущем сделать раунд(или что то типа того) и вот мы видим раунд от него!
Извини, но твоя ссылка меня отправило на английский пост и там нету никакого комментария от автора, надо было сюда делать ссылку)
А вообще ссылки надо делать так
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? :)
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.
Deleted.
T-shirts in div-2 round? RLY?
ah, just wanted to leave this guy here :)
alright, no more stupid pictures, sorry.
I dont understand. Do they gift t-shirts? Plz give more info to me.
They gave t-shirts at Codeforces Round #100 to the top 100 contestants. In fact, there were two participants at the 100th place)
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?
Do not try to understand logic of voting in codeforces)))
Why not codeforces round (1<<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. :(
I hope, for all this anniversary round.
What does this even mean?
oh, I was weak in english
I meant
I hope for everybody this is significant roundIt'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?
A slight mistake: last ((((2^2)^2)^2)^2)... round
basically, the last 22x round.
:)
1 << (2 << 2)
i actually meant 224 (i.e.
1 << (1 << 4)), but u are also right.Give T-shirts to top 256 contestants who are not unrated ?
Good Idea.
Ok not good. i hav understood. Because the div 1 group has better people and deserve "more".
Lol. Chill man. You don't have to respond according to the number of upvotes/downvotes your post gets.
Again, please take the time to write a meaningful editorial.
hard contest
Надо же, как я удачно потерял в прошлом раунде 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 .
Also don't make too easy...
It's a special Round. I think it will be an interesting round.
You really mean the round is interesting?
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...
You mustn't create more than one account. See Help.
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
You participated in the round with this fake account . This account should be banned !
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 :)
For some eastern countries 19:30 is not comfortable, because contest ends too late. However I would like 19:30, too)
Since this round is sharply before the "NOI" Contest in China, some use their minor account to participate in this round>_<
What's minor account?
I think he means it has less priority to participate
А как размещены задачи в раунде? Они идут по возрастанию сложности или случайным образом?
Конечно по возрастанию.
Спасибо за ответ и за раунд))) P.S.: Всем удачи и высокого рейтингу.
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?
Bang! Not exactly. A more ' popular' one is Zepto Code Rush which 4663 participants took part in :)
Я конечно все понимаю, но этого я не понимаю! Хреновая какая-то динамичная разбалловка получилась...
500 — 500 — 2000 — 2000 — 3000
посмотрим, что будет после финального тестирования))
Получилось еще интереснее)
500 — 500 — 2500 — 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
Not exactly.
1815 Pretest Passed
1449 Accepted
in D, shouldn't the problem ask for the k-th smallest number (not k-th largest)?
Oops! My bad!
Not actually...
1 2 3 4 5What is the second largest and second smallest value of above sequence ?
Yeah I was pretty confused for a while.
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.
your implementation might have some issues, the greedy strategy is fine :)
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.
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 ).
Мой решение задачи В не прошло шестой тест. Можете дать тест
line 34
нет строка был закомментирован
kabann
banka
ваш ответ need tree
правильный both
tocacol cot
правильно both твое need tree
спасибо . очень устал потом решу
there was a ghost in the 5th pretest of B! what is the solution of B???
Check your "automaton" case.
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?
Answer is automation.
The problem statement states that
i agree.
the main keyword was "only". I missed it for a long time and lost important time and points :(
No spoiler but please give some idea about intended solution for C and D.
d — binsearch
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)
can you give me the code? just paste it into pastebin.com, and give the link.
thanks.
According to the system test my solution is wrong so... :(
can anybody please explain how to solve D.. thanks
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
Thanks! That' s clear enough! :)
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)
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.
Thank you, that's a great explanation!
This problem is a classic problem . It's called Young tableau , you can search it on the internet :)
I googled but could not get how this is Young tableau. Would you explain DylanJiang?
Has anyone see someone hack problem B ? i didn't see a single one
screenshot
DmitriyH will post the statistics for the round soon. We will be able to see how many B solutions were hacked there.
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!!
This is dynamic score distribution. :)
You can see this blog if you want to know details about
Dynamic Score Distribution. :)First time in top 20 ;)
Добавил в Д для спокойствия иф с выводом ответа, а он оказался не правильным))
Найдите 10 отличий!
Вот в этой комнате, между вот этими кодами:
7127854 && 7136545
7124532 && 7137613
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?
be patient. it usually takes about half hour after system testing finishes.
Буква Т-Тормоз: правильно придумал решение C, но затупил в реализации, поставив ноль в неправильном месте. Контест хороший, задачи были интересные.
.....So unlucky.....The "Verdict" is "skipped"....The all..
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.
In problem B I was printing "automation" instead of "automaton". I was not able to debug this during contest :(
What a pity...
it happens because of lack of practice..
Next time try Ctrl+C and Ctrl+V. It really helps :)
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.
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.
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. :)
As usual, Country wise standings here [Unofficial participants not included]. Hugs and Bugs here.
Thank you! I was waiting this)
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.
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.
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
Oh, I have realized there is something wrong in my binarysearch, which leads to an endless iteration.
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