| # | 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 |
|
+1
Problem F was really nice. Thanks authors. :blobheart: |
|
+3
Look at the constraints. $$$1 \leq a_i, b_i \leq n$$$. Your test case violates this constraint. |
|
+5
For bonus part of C, you can refer to my solution. Time Complexity: $$$O(n\;log(d)\;log(k) + n\;log(n))$$$. |
|
+11
Thanks! |
|
0
Thanks. Is there a way I can see the test case? |
|
+13
Can anyone hack this? I did a randomized solution to D: |
|
0
Can anyone please let me know why the first submission is giving WA on test case 6, while the second one passes? |
|
+13
That's not quite true. You could have length of subarray greater than 900 if the minimum element is 0. So I think you'll have to account for all the subarrays that contain a 0 along with the subarrays that you mentioned. Also, one of the reason that it TLEd could be because you didn't use fast io. |
|
+10
problems added now |
|
+1
Truer words were never spoken. |
