→ Обратите внимание
До соревнования
Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
15:46:10
Зарегистрироваться »
Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
15:46:10
Зарегистрироваться »
*есть доп. регистрация
До соревнования
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
15:46:10
Зарегистрироваться »
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
15:46:10
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.05.2026 17:18:51 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
If they would have been the same, then it wouldn't have failed on 21.
Can you help me matcoder without an 'h'??
I am sorry, but I tried to look at the codes. The only thing I found that would result in Wrong Answer is that no function in the second code has been called recursively (which may cause local flags to be set only once) and there are two conditions while checking (only 1 in the first code).
Not sure though. But I'll have a closer look at it again if the query persists after a day too.
The two conditions in 2nd code are analogous to one condition in 1st code as s and p are connected and c==p case is handled as there is no self edge.
If you want help, write nice code with comments and meaningful variable names. And explain your solution.
Your two solutions differ a lot. In your WA solution, you only consider edges $$$(p, s)$$$ that belong to some spanning tree. In other words, you don't go through all edges $$$(p, s)$$$. Note that there are $$$M$$$ edges while DFS function will run only $$$N$$$ times in a connected graph.