[submission:https://codeforces.me/contest/1774/submission/250501754]
i have checked everything but cant find the bug
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
[submission:https://codeforces.me/contest/1774/submission/250501754]
i have checked everything but cant find the bug
Название |
---|
set<int>&
. I don't see you modifying the set indfs2
, so it is safe to pass it as a reference. If not, the complexity is raised to $$$N^2$$$ due to there are $$$N$$$ dfs calls and the set is copied each time. (The logn part grows slower than the set copy part.)you're copying the set object -> O(n) -> O(n2 * log(n))