Hello.

**UPD** Old links don't work. New: https://www.dropbox.com/sh/b9apawmc61mzq3p/AADvGv3iF6cHwEEJ4anth5IYa?dl=0

# | User | Rating |
---|---|---|

1 | Benq | 3783 |

2 | jiangly | 3666 |

3 | tourist | 3611 |

4 | Um_nik | 3536 |

5 | inaFSTream | 3477 |

6 | fantasy | 3468 |

7 | maroonrk | 3464 |

8 | QAQAutoMaton | 3428 |

9 | ecnerwala | 3427 |

10 | Ormlis | 3396 |

# | User | Contrib. |
---|---|---|

1 | Um_nik | 184 |

2 | adamant | 178 |

3 | awoo | 177 |

4 | nor | 169 |

5 | maroonrk | 165 |

6 | -is-this-fft- | 164 |

7 | antontrygubO_o | 152 |

8 | ko_osaga | 151 |

9 | dario2994 | 150 |

10 | SecondThread | 149 |

Hello.

**UPD** Old links don't work. New: https://www.dropbox.com/sh/b9apawmc61mzq3p/AADvGv3iF6cHwEEJ4anth5IYa?dl=0

↑

↓

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/03/2023 20:17:25 (k2).

Desktop version, switch to mobile version.

Supported by

User lists

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.