Link to original problem: 1004F - Sonya and Bitwise OR
In the original statement, the query to update is point update only.
How can I solve this problem, suppose the first query is (1 L R Y) : assign value of a[l] ... a[r] to y
Thanks for the help !
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
Link to original problem: 1004F - Sonya and Bitwise OR
In the original statement, the query to update is point update only.
How can I solve this problem, suppose the first query is (1 L R Y) : assign value of a[l] ... a[r] to y
Thanks for the help !
In original problem 1175F - The Number of Subpermutations, it is required to count the number of subpermutations that consist number from 1 to r — l + 1, each appear exactly once
I managed to solve it using two pointers, expanding from position i whereas a[i] = 1
How do I count number of subpermutations, starting from x to x + r — l, for example : [1, 3, 2] and [2, 4, 3] also counts. Also, it would be great if someone can find the submission link for this problem. Thanks for helping me.
| Name |
|---|


