№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
2 | maomao90 | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | SecondThread | 146 |
8 | TheScrasse | 146 |
10 | Petr | 145 |
so i was solving https://codeforces.net/contest/1138/problem/E. the idea here is quite obvious. compress all SCC as a single node and solve it like a normal DAG
then something strange happening. at the beginning i got a RTE verdict for my solution. when i was trying to find bugs in my code, i tried to reverse engineer and add this code my first DFS function (i used kosaraju's algorithm) :
if(n == 99998 && m == 99999 && d == 50) { if(u.fi > 100000 || u.se > 50) { cout << "KOSA : " << u.fi << " " << u.se << "\n"; fflush(stdout); } }
magically, adding this piece of code to my solution give me an AC verdict.
RTE solution : https://codeforces.net/contest/1138/submission/51269031
AC solution : https://codeforces.net/contest/1138/submission/51268839
so what really happened? is there any error in CF?
Название |
---|