| # | 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 | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
TLE on following editorial aproach
I am following the editorial for this problem 489D - Невыносимая запутанность бытия and am getting TLE on test case 7. 55729287 Can someone point out what is the difference between my implementation and Mike's.
I am also using brute force of selecting the two end nodes and then counting the number of intermediate nodes which provide path length of 2 between the selected nodes.
Anyone out there???
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
aman_naughty | 2019-06-22 23:36:44 | 42 | Tiny change: 'I am follo' -> '### Your title here...I am follo' | |
| en2 |
|
aman_naughty | 2019-06-22 10:57:29 | 23 | Tiny change: 'ted nodes.' -> 'ted nodes.\n\nAnyone out there???' | |
| en1 |
|
aman_naughty | 2019-06-18 23:03:03 | 479 | Initial revision (published) |
