| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
|
+3
Exactly, that's why I had done too! |
|
0
I am in. |
|
+18
Congratulations on reaching IM!! And I am sure you will be able to reach Grandmaster by the end of this year. |
|
+14
Well... it's not that difficult for him to cross 4000, he just needs to secure rank 1 in the next contest. That's it!! |
|
+2
queueforces |
|
0
Congratulations on reaching Pupil! |
|
On
dorjderem →
Anyone who comments under this post has to reach CM by September if can't...., 2 years ago
0
Quite realistic target!! All the best bro.. |
|
On
dorjderem →
Anyone who comments under this post has to reach CM by September if can't...., 2 years ago
0
Challenge Accepted!! |
|
-6
SPOT-ON |
|
0
Can you pls share your approach? |
|
0
Oh right! |
|
0
Yeah definitely, I think it should be around 1700 rated. Actually, I thought to find the longest non-increasing subsequence and remove it from the array. Then I have to calculate the cost of the remaining portion of the array. That should be the answer. But I could not implement it. |
|
+28
Yeah, I agree with you. The color should be changed to a slightly darker shade of orange. The current shade creates a bit of confusion. Btw.. congrats on reaching master!! |
|
0
Wow, thanks man!! Definitely, this will help us a lot... |
|
0
I can relate too |
|
0
yeah right, even everyone all of my friends have solved it. |
|
-12
B is soo tough... |
|
+3
I can see that you have been consistent for the past few days. Hope you reach green, good luck bro!! |
|
+14
omg no green round |
|
+7
I guess you can become pupil in today's round if you solve A and B fast. Good luck!! |
|
0
Yes, C2 ladders is much better than a2oj ladders in today's date... I have improved a lot by practicing problems from this site! |
|
0
This site is an absolute gold!!! I have improved a lot by practicing problems from C2 ladders. |
|
0
For the answer to be 'YES', the necessary and sufficient condition is that the XOR of a[i] and b[i] for every i from 1 to n, must be equal. It is not that a[i] has to be different from b[i]. |
|
0
Great idea!! I had never thought in this way... |
|
+11
Congratulations on reaching GM!! |
|
+33
Oh.. you are close to 2400. Wish you luck for today's contest, hope you become GM.. |
|
0
Solve A and B problems very quickly and you will become pupil. Also don't make any wrong answers. All the best bro! |
|
+11
omg green round |
|
0
Same for me as well... it was one of my best contests |
|
0
Just awesome... |
|
+6
I guess somewhere around 1700... |
|
+6
Congrats bro on becoming pupil!! |
|
0
Congratulations on becoming candidate master!! Yeah it really feels great... |
|
0
Yup, exactly that's what I do too. |
|
0
Yeah, it was not working on my computer too. I just uninstalled sublime text and then again installed it. Now it is working perfectly fine. |
|
0
Comparator functions always follow strict weak ordering. In C++, comparators should return false if it's arguments are equal, but yours is returning true. |
|
+3
Don't worry. I also felt that A was tougher than usual. |
|
0
Exactly!!! I used Selection Sort in this problem during the contest and unfortunately I got WA in both the submissions, but now when I implemented the exact same logic in Bubble Sort, it got accepted. This indicates that implementation with selection sort has some complications which bubble sort doesn't have. |
|
0
Ya right, I do not face much problem to code, after I have built the logic. The hardest part in solving B and C problems of Div2 is in building the logic, which requires a good amount of math skills. |
