Hi CF community Xenia and Weights I am thinking about this problem past 3 days and not got any approach in my mind reading editorial also didn't helped me (for this problem) please share your approaches and how did you solved it Thanks and regards
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
22:06:38
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
22:06:38
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 19:28:23 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by nipul1 (previous revision, new revision, compare).
What about writing a comment below the editorial? Explain which part you didn't understand.
they have converted the problem into a graph problem 1) what they are going to do with that graph 2) is there any other way to solve this (without graphs) Thanks for replying
I thought that writting comments in editorial may not help for such old contests (I haven't tried it though ) .
You can consider a graph where your nodes are tridimensional , (pos,diff,prev) where pos is the current step, the diff is the current absolute difference on the two scales , and prev , is the las used weight , we can see that prev in [1..10] as well as diff is in [1..10] becase if the difference is greater than 10 we can see that it's impossible to place a weight that can overweight the other , you can do a simple dfs in graph having a m*10*10 nodes and for every nodes there is a maximum 10 edges, and you can take the first possible combinaison by keepin track of the weight you put in a vector and then erase it if it's an impass, here is my submission 67966582
Thanks Sir
Auto comment: topic has been updated by nipul1 (previous revision, new revision, compare).