Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
37:27:10
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
37:27:10
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 04:07:50 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
Автокомментарий: текст был обновлен пользователем fcspartakm (предыдущая версия, новая версия, сравнить).
Where can we get the questions in english?
Click
I think that k = 0 is a special case in the problem D.
769A
Можно проще: разделить сумму чисел на их количество.
769B
Можно не сортировать. Сначала отправляем сообщения тем студентам, которые сами могут отправлять новости, а потом тем, кто не может.
769D
"заранее предпосчитать массив, содержащий количество единичных бит для каждого значения."
Уточню: не для каждого значения, а до 1<<14.
C. Цикл в рабиринте. Вот с таким вводом:
Мой вывод — LRLR, а должен быть IMPOSSIBLE
Я не пойму почему. Ведь можно ходить на одни и те же клетки сколь угодно раз?
Это твой вывод — IMPOSSIBLE. Ты не учитываешь, что можно ходить в стартовую точку. LRLR — правильный ответ.
What is test 49 for problem C???
I get WA on it, and couldn't understand what I did wrong, Can anyone please see my code:
25221347
Yes!!! I also asked about it and I got this message:
There is some bug within this algorithm. I find out some kind of data that can prove it wrong.
This version of code's answer is
DDDLLDDRDULUURRUUU
But the true answer should be
DDDLLDDRDRRUUUUUUL Arriving the position "b", obvoiusly the previous answer is not the good one.
I have submited another code for this problem and got it accepted.
Thank you.
Hope it helped
Exactly :D
finally I knew whats wrong with my approach, thanks a lot man, I owe you one :)
BTW, the correct answer for this case is DDDLLDDRDRRUUULUUU since 'L' is minimal than 'U' Hope you update it soon enough, Thank you!
thanks buddy
I did the same reversal algorithm 26987013 and was so mad how it didn't pass although I'm choosing the minimal each step! Thanks so much for that lovely hack! :)
I am getting a WA on test 9 on this DIV 1A. Can someone please help?
This is my submission.
I am getting a WA on test 9 on this
Can someone please help?
This is my submission.
I am getting a WA on test 9 on this. Can someone please help?
This is my submission.
Can anyone help me with time complexity of Editorial solution C?
How to solve D using Meet in the Middle? Thank You.
Can anybody please help me out with (C .Cycle in the Maze ),why using dfs i'm getting runtime error on test 8(stack oveflow error).https://mirror.codeforces.com/contest/769/submission/67518247
For problem C cycle in a maze. I would like to clarify a few points. First of all, a solution exists only when k is even because for every right step there has to be left step to neutralize it and for every up step there has to be down step to neutralize only then the initial and final positions could be same. 1)The use of 'D','L','R','U' is done in this order because it would result in the construction of the lexicographically minimal cyclic path which is the requirement of our problem. 2)The second point is that the robot never goes out of the reach of its initial point ch[x][y]='X' and therefore there is always a chance of returning back to the initial position. 3)Suppose currently robot is on the position a since dis[a]<=k so it can go back to the initial position back from here using the same path through which it came as there are no restrictions in travelling the same cell multiple times(even the starting one). My submission https://mirror.codeforces.com/contest/769/submission/94294357
Thanks, nice solution :)
why 2 loops in problem D do not cause TLE ?