| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
|
0
... |
|
0
Too familiar :)) :)) |
|
0
I think it only have two case like number 6 (loop) and 1 (or a point) :)) :)) The first line ans is total tree — 1 (if have at least 1 tree like number 1) or total tree (if all tree like number 6) |
|
+6
I think pretest for problem B is very very not good :( :( |
|
+4
You should thanks hacker because your solution is Wrong and you can fix before contest end :)) :)) |
|
0
Note: 0...n-1 vs 0..m-1 (not n and m) :(( :(( so 7 7 must solve with x:x (not xx:xx) |
|
0
Note: 0...n-1 vs 0..m-1 (not n and m) :(( :(( so 7 7 must solve with x:x (not xx:xx) |
|
0
problem D is exciting, DP but not simply DP :)) :)) |
|
0
I WA in pretest 4 and after that I read threads again: "All key 1 open" (not (1,1)) |
|
0
You must go from (1, 1) to key 1 -> 2 ->... -> p ;) ;) |
|
0
O(m * n * m * log(m * n)) with list + binary search and a little lucky!! :D :D |
|
+8
Complete problem D and thinking about sleep :)) :)) |
|
0
The subjective and easy to lost points :)) :)) Sometimes me too :(( :(( |
|
0
UDP: Sorry, I have found the ans. |
|
0
Ouput: INFINITE ??? |
|
0
Problem B write too difficult to know :( :( At least for me... And I waste so many time to understand... Down to 1k5 again :(( :(( |
|
0
Example: IAO'1999 => from right to left: 9 => 1989 | 99 => 1999 | 999 => 2999 | 1999 => 11999 |
|
0
5am... |
|
0
your memory = 262100 KB > memory limit per test: 256 megabytes |
|
0
Thanks for timing!! Happy Tet Holiday!! <3 <3 |
