Hello.
UPD Old links don't work. New: https://www.dropbox.com/sh/b9apawmc61mzq3p/AADvGv3iF6cHwEEJ4anth5IYa?dl=0
# | 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 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Hello.
UPD Old links don't work. New: https://www.dropbox.com/sh/b9apawmc61mzq3p/AADvGv3iF6cHwEEJ4anth5IYa?dl=0
Name |
---|
Where I can submit my solutions?
IDK really. I tried to find out but couldn't find anything.
you can submit problems in exam :)HAHA
Can anyone who solved problem A explain their solution?
I was thinking of a hacky solution of creating segtree storing xor, sum, product(mod prime) of a range in node, then query to check if those properties are equal. I do not ex[pect this to be the official solution. Can anyone post the solution/hints?
Hint: For each number remember nearest left/right element with same value. It's easy to change this value during update.
If a[l,r] is a permutation: 1) Minimum is 1
2) Maximum is r-l+1
3) All elements are distinct( minimum of left values <= l)
Create a segment tree and store sum of where . To check just compare the sum of segment with . Update is easy.