Hello.
UPD Old links don't work. New: https://www.dropbox.com/sh/b9apawmc61mzq3p/AADvGv3iF6cHwEEJ4anth5IYa?dl=0
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.