Before contest

Codeforces Round #522 (Div. 1, based on Technocup 2019 Elimination Round 3)

13:20:27

Register now »

Codeforces Round #522 (Div. 1, based on Technocup 2019 Elimination Round 3)

13:20:27

Register now »

*has extra registration

Before contest

Codeforces Round #522 (Div. 2, based on Technocup 2019 Elimination Round 3)

13:20:27

Register now »

Codeforces Round #522 (Div. 2, based on Technocup 2019 Elimination Round 3)

13:20:27

Register now »

*has extra registration

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

1 | tourist | 3372 |

2 | mnbvmar | 3345 |

3 | OO0OOO00O0OOO0O0…O | 3264 |

4 | Radewoosh | 3230 |

5 | scott_wu | 3189 |

6 | Benq | 3187 |

7 | LHiC | 3171 |

8 | Um_nik | 3155 |

9 | V--o_o--V | 3152 |

10 | Petr | 3139 |

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

1 | Radewoosh | 191 |

2 | Errichto | 172 |

3 | rng_58 | 158 |

4 | neal | 156 |

5 | Um_nik | 154 |

5 | tourist | 154 |

7 | Ashishgup | 152 |

8 | Petr | 151 |

9 | PikMike | 150 |

9 | 300iq | 150 |

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/18/2018 05:44:35 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

What about un-official participants ?

Here

..

Can you give the problems?

https://www.dropbox.com/sh/ljs9b2ifjza19qb/AABKgvi7CbEZq8KBlBoJlYRFa?dl=0 sorry for not clear statement.

Can you please find the english version? Also IZHO organizers didn't realize that it's "2018" now.

https://drive.google.com/open?id=1yxBQlxS5ujJkm8PgEo7vbjXO0kuSkTeY

Thanks what about today's problems and results?

I don't know results, but I'll send today's problems

Yeah, please

Totalresults ofIZHOALL Statement in 2 languages

Are these observations true and sufficient for solving treearrray?vvYes

Yes I used it in my solution and I got 56 points (complexity O(n^2)). But there is one more observation that if v is in the array answer can be subarray consisting only from v.

Day 2 results: https://photos.app.goo.gl/Av6yktTHQ5J4Kml22

Tima, Can you change style of contests (which in the group) to ACM ICPC style. And access to see code, if you solve this problem.

Sorry for my English.

I think IOI format is better suited.

What about access to see code, if you get max. score. Can you do this?

I think it would be better if you make each sub-task a problem in codeforces so you can see how many sub-tasks your code passes.

Why there is only results of people who have got a medal?

Fixed. All results are available.

How to solve problem A from the second day?

I think sqrt decomposition and bin. search.

Where can I find the solutions?

Here.

Access Denied (for the tests and solutions)

Now it should work. Sorry for the inconvenience caused.