| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
If it only happened to me, it's fine. Thank you for an interesting problem set. :) |
|
+14
First of all, my bad for having a wrong idea and not looking at test samples carefully but I think these kind of things shouldn't happen during the contest....
|
|
+9
Great round! |
|
0
Great contest! |
|
0
Could you post a link to your solution? Thank you in advance. :) |
|
0
Tnx. I learned a lot from you! Have a nice day. ;) |
|
+7
Could you explain problem 5's solution using BIT in more detail? Tnx. :) |
|
0
Could you share your approach for a start? xD I solved it using MO's algorithm but I am interested how you did it using segment tree. |
|
+3
Would someone be kind and explain me why my solution (23608573) for D fails? Thank you in advance. :) |
|
0
So far |
|
0
Tnx 4 the help. :) EDIT: You were right. I fixed the fast I/O for negative numbers and then I got TLE. |
|
0
Auto comment: topic has been updated by Pranky (previous revision, new revision, compare). |
|
0
Has anyone tried solving D using a binary search? |
|
+3
Has anyone tried solving D using a binary search? |
|
0
Thank you! |
|
0
Could you please explain why you ignore the input of S variable? Tnx in advance. :) |
|
+5
Can somebody please explain me what is wrong with my solution for problem C? Thank you in advance! :) http://codeforces.me/contest/682/submission/18561628 EDIT: Nvm, I think I got it. |
|
0
Tnx for providing us with your clear and simple solution. :) |
| Name |
|---|


