Hello!
Codeforces Round 486 (Div. 3) will start on June 1 (Friday) at 14:35 (UTC). It will be the third Div.3 round in the history of Codeforces. You will be offered 6 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.
The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.
Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:
- take part in at least two rated rounds (and solve at least one problem in each of them),
- do not have a point of 1900 or higher in the rating.
Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.
Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to Maksim Neon Mescheryakov and Ivan BledDest Androsov for testing the round.
UPD: I also would like to thank step_by_step and eddy1021 for testing the round and help with it preparation!
UPD2: You will be given 6 problems and 2 hours to solve them.
UPD3: Editorial is published. Thanks to Mikhail awoo Piklyaev for the help with translation.
UPD4:
Congratulations to the winners (official results):
| Rank | Competitor | Problems Solved | Penalty |
|---|---|---|---|
| 1 | volamtruyenkyii | 6 | 196 |
| 2 | IOI2018 | 6 | 238 |
| 3 | Student_of_Husayn | 6 | 303 |
| 4 | fshp971_ | 6 | 311 |
| 5 | Deadpool | 6 | 313 |
| 6 | Jajceslav | 6 | 341 |
Congratulations to the best hackers:
| Rank | Competitor | Hack Count |
|---|---|---|
| 1 | jhonber | 70:-1 |
| 2 | djm03178 | 61:-4 |
| 3 | applese | 53:-1 |
| 4 | Midoriya095 | 41:-3 |
| 5 | step_by_step | 38:-5 |
| 6 | greencis | 57:-45 |
530 successful hacks and 401 unsuccessful hacks were made in total!
And finally people who were the first to solve each problem:
| Problem | Competitor | Penalty |
|---|---|---|
| A | Uzumaki_Narutoo | 0:02 |
| B | Ad1let | 0:06 |
| C | Ad1let | 0:12 |
| D | volamtruyenkyii | 0:23 |
| E | fafafa | 0:19 |
| F | MuieEcaterina | 0:49 |
I hope that you will like the problems. If the problems in this round are too easy or too hard, then we will adjust the difficulties in the next Div. 3 rounds.
Good luck!
