| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3640 |
| 2 | Benq | 3593 |
| 3 | tourist | 3572 |
| 4 | orzdevinwang | 3561 |
| 5 | cnnfls_csy | 3539 |
| 6 | ecnerwala | 3534 |
| 7 | Radewoosh | 3532 |
| 8 | gyh20 | 3447 |
| 9 | Rebelz | 3409 |
| 10 | Geothermal | 3408 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
|
+1
DP by O(16n) I'm not sure it's a correct algorithm. |
|
+8
see this: https://codeforces.com/blog/entry/60921 |
|
+11
a sudden disappear of round499 rating record? |
|
+8
BinarySearc(h)es |
|
+3
This round makes me realize how poor my math is.TAT. |
|
+3
Er,I think the best solution is O( K*(N+M)+ N*(KlogK)(that is for sort) ) by using BFS. |
|
-24
ahh |
|
-20
emmm |
|
+1
Try to find the minimum distance between every node i and a specific kind of good j,let's make it mind[i][j].all you need to do is run BFS for every j and sort mind[i] out. (maybe some stupid grammar mistakes,forgive me for that,please.) |
|
+1
yeah,that's a interesting take. |
|
+17
yeah,it's seems that there are always some incidents occur when setters forget to do that. |
|
+3
I'll bet for 3:15(UTC+8) |
|
0
almost all problems have a statement??????That's Terribleeeee! |
