| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
question here is my_solution
My approach I have replaced vertices given in query with their immediate parent and then checked if the nodes in the sequence are child of each other....
My code has failed on 100th testcase that's only I am asking for help
contest :-- https://mirror.codeforces.com/contest/1174 question 2nd link :-- https://mirror.codeforces.com/contest/1174/problem/B
I have the same logic like various other contestants have used but I got TLE on test case number 63 as i had used JAVA whereas others have used C++. this is a very disappointing for me and i am not getting the logic behind this. Everyone knows that JAVA is bit slow than C++ but this is not acceptable that u change your logic or thinking process on this fact My submitted cod is 55027519: please anyone explain me why this happened;
