Please recommend some graph problems that are hard to determine. I mean there are no vertices or edges in problem statement but you can create(or not) them yourself and apply graph algorithms. I'll add them to this blog.
Problems
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.04.2024 16:56:51 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
problem 1, problem 2
you aren't improving your skills for graph finding if you already know from the start it's a graph problem...
?????????????????????
True
What are the basics? I consider basic graph theory the basics...
He/She could not solve a single problem in Educational Codeforces Round 102...graph theory is basics, but I suppose when one can't solve an 800 problem, it's this whole new level of basic.
It has nothing to with you if I can't solve these problems. I simply asked for problems politely but you humiliate me.
You can always just look for codeforces problems tagged graph theory???
I didn't ask for problems from codeforces specifically and there are other OJ's with no problem categories.
Use Google & well-known Morass blog then??? (LeetCode problems tend to be on the easier side, but whatever)
LeetCode LeetCode LeetCode
Codeforces Stuff
CF CF
And that should be more than enough lmao...stop asking and start DOING
I didn't know about the Morass blog and probably neither did the author. Try to be more polite, as simple as linking the resources and saying "here you go, hopefully you find them interesting."
In my opinion, constructive and mathematical thinking are more 'basic' skills when it comes to CP, along with 'techniques' (using it very vaguely here) such as prefix sums and binary search.
Ig things like basic stl knowledge and basic math like prefix sums is before it, but I would but making an adjacency list to dfs at the same level as binary search (ie I learned them at basically the same time). If I was teaching a class, graph problems would be one of, if not the first topics I introduce since I think it is best way to show both the programming style and mindset of cp (in my cp ideals).
Anyway I mostly just don't like people telling less experienced they shouldn't be touching "advanced topics" yet.
That's fair. I learned simple stuff like graph traversal with DFS pretty late compared to other stuff at the same level, so I think I probably have a slightly skewed sense of difficulty for these topics.
https://open.kattis.com/problems/dontfencemein
https://acm.timus.ru/problem.aspx?space=1&num=1035
Couple of nice problems in a recent Atcoder contest.
https://atcoder.jp/contests/arc111/tasks/arc111_b
https://atcoder.jp/contests/arc111/tasks/arc111_c
Why the hell you want to spoil the problems? Kind of problems you are asking for are special(rare and difficult) because you don't know graphs are to be used in them. By revealing that graphs are being used, you made the problem a lot easier to solve.
Edit: Others also don't list problems here in which it is difficult to deduce that graphs are needed.
I practice around 50% of my time knowing the category beforehand. If you've had a lot of contests and you know that "hey, I always seem to mess up on graph problems" it's definitely worth it practicing on graph problems (in other words there's nothing wrong with practicing a specific category).
Hey!
Here's one of my favourite problems (it's the first 'implicit' graph problem I did).
POI Sums