Of course, it was a great round, but I guess I have a nice summary of it here:
№ | Пользователь | Рейтинг |
---|---|---|
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 | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Of course, it was a great round, but I guess I have a nice summary of it here:
Can anyone help me to describe the algorithm for solving this APIO 2012 Kunai?
http://apio-olympiad.org/2012/apio2012-official.pdf
Thanks XD
Hello kids,
I recently learned algorithm for finding bridge edges, but I couldn't find a clean code on it. Can anyone provide a nice implementation for the algorithm (I think it call Tarjan) for finding bridge edges?
Thanks very much!
Hello kids,
I am having a bit trouble with this problem from the IOI 1995. I solved part (1) by removing each node and checking for connectivity, but I cannot know how to solve part two, or give some reformulating in terms of graph theory. I cannot really understand what this part B is saying or asking for. (Some simple condition like part (1))
Does anyone have any ideas?
Thanks very much!
Название |
---|