As 2024 nears its end, let’s share the problems we enjoyed the most this year so far! Drop the problem name, link and what made it special (optional).
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.12.2024 21:58:41 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
2044F - Easy Demon Problem Quite an interesting problem, looked really hard but had an easy mathematical solution (Do give it a try if you haven't).
Would you mind giving some hints about it?
Think about how you could decompose the query that you have been given into parts that you can correlate with the orignal input.
Try factoring
Indeed, this is one of the best questions I came across this year.
1933E. Xor-Grid Problem It demonstrates the magical nature of XOR operations, completing the missing rows and columns in an array.
1919D — 01 Tree Everything fits so nicely together!
1878F - Vasilije Loves Number Theory
2029C - New Rating Although dp is easier to think here, the bin search solution is really satisfying.
1843E — Tracking Segments binary search on the prefix sum!
https://codeforces.me/contest/1931/problem/F It was such a nice thing to use cycle detection in a statement like this.
Universal Cup 3.11 O - New School Term
I enjoyed being trolled by this problem. The final observation is so natural, yet so invisible. As far as I know, some LGMs were also trolled.
Can you share the observation? My idea is a bit ugly.
I have a straightforward $$$O(n^2 \sqrt n \log n / w + m)$$$ solution. Try adding edges to a graph in decreasing order of index. Check if it is possible to add the current edge to the graph, such that it remains bipartite. If the current edge will destroy this property, then skip it.
Let the value of the component be abs((number of nodes in the first group) — (number of nodes in the second group)). You want to find if you can have a sum of 0 by multiplying some of the values of the components by $$$-1$$$. There are at most $$$n - 1$$$ edges that can merge two components. For each of these edges, you run a DP.
If the edge is wrong, it connects nodes of the same color. So you can merge the two components anyway.
I feel so stupid now ;-; Thanks!
1977D - XORificator never seen this trick before and thought it was unsolvable before seeing the tutorial
https://codeforces.me/problemset/problem/2042/E
ARC171E — Rookhopper's Tour
The setting feels very chaotic to me initially, but after thinking it though, it turns out there exist an elegant way to analysis the problem model very simply to make it solvable. It's just... astonishing!
https://codeforces.me/contest/1991/problem/H
D. YEET!
Not because I'm the author , but because the non-randomized solution is really satisfying and cool !
For Problems I solved , hmm
B. Shohag Loves Strings is cool.
D. Harder Problem is indeed a nice "harder" trolling problem .
https://codeforces.me/contest/321/problem/C
My 1st and only centroid decomposition AC
I don't know about best problem, but worst problem of the year is definitely problem C in APIO, the problem sucks A LOT