Hlw everyone, Please give me guide to become pupil Which Which dsa should i learn . Plz help me. Thank you all.
Codeforces и Polygon могут быть недоступны в период с 6 декабря, 22:00 (МСК) по 7 декабря, 00:00 (МСК) в связи с проведением технических работ.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3443 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | djm03178 | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.12.2024 05:36:16 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
You don't need some specific dsa.
you should know about basic data structures like min heap, max heap, stacks and queues, and linked lists. Along with you must know binary-search related things and a little bit of dp. Plus a lot of bit manipulations and number theory
These are some topics that sometimes come in div2 contests in the first 3 problems,
For a major number of problems, you just need to improve your implementation skills and learn more about the language you use.
It's amusing that you're advising him on becoming a pupil when you're still a NEWBIE!
because sometimes people who have failed a lot of times can give good advice compared to people who have succeeded
You are correct
Cause they usually end up knowing more ways to not fail.
what is min heap and max heap and you dont need to know linked list i never used it in a cf problem
yeah never saw a linked list problem on cf, I solve leetcode also that's why I wrote it, and max heap and min heap are just data structures implemented using priority_queue in stl for c++ and PriorityQueue in collections for Java
leetcode is different to cf you might find those data structures there but there are different ones that are more in use here tbh the most important is number theory dp and bs
Thanks you very much for your suggestions
if u use cpp then u must know stl, solve adhoc problems, learn number theory and binary search and u will reach pupil
What adhoc means ??
adhoc are types of problems, where no particular template of solutions or a fixed algorithm can work
tag search constructive algorithm problems they are adhoc no extra knowledge helps just pure thinking and your problem solving skills are tested
This was a really genuine advice. Everyone tells just to solve problems. But I think these topics hold us back from becoming pupil fast.
ezy.. do more problems which are slightly above your comfort zone.
Personally, I wouldn't worry about DSA at thos point and instead focus on figuring out the trick to ad-hoc problems more, which will almost definitely help you solve A and B in Div2 rounds. Personally, I was able to get to pupil with no DSA (aside from one use of DFS, but I hadn't learned it yet and kinda guessed how to do it mid comp).
Something something useless algorithms solve problems learn binary search?