Codeforces Round #527 (Div. 3)

Revision en6, by Vovuh, 2018-12-19 20:19:05

I'm in the middle of the session but I'm still trying to prepare Div. 3 rounds.



Codeforces Round #527 (Div. 3) will start at Dec/18/2018 17:35 (Moscow time). You will be offered 6 or 7 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.

You will be given 6 or 7 problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

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 my good friends Mikhail PikMike Piklyaev, Maksim Ne0n25 Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.


UPD: I also would like to thank Roman Ajosteen Glazov, Farkhod Farhod_Farmon Khakimiyon and Alex hohomu Poon for help with testing the round.


Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 Doma_Umaru 6 331
2 BigDelta 5 141
3 AbduM 5 262
4 paulomirandamss12 5 266
5 Fill_in 5 276

Congratulations to the best hackers:

Rank Competitor Hack Count
1 Marcosk 84
2 hmducanh 67:-4
3 jsuyash1514 58
4 Muhanad_Alwarareh 29
5 electrostrike 25:-2

796 successful hacks and 2063 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A sorry_hater_snsd_is_good 0:01
B ajarindong 0:02
C BigDelta 0:15
D1 bin_0808 0:26
D2 bigbigbigcat111 0:40
E Patunia 0:24
F Patunia 0:12

UPD3: Editorial is published!

Tags codeforces, 527, third division


  Rev. Lang. By When Δ Comment
en6 English Vovuh 2018-12-19 20:19:05 80
ru6 Russian Vovuh 2018-12-19 20:18:41 76
ru5 Russian Vovuh 2018-12-19 18:45:33 2563
en5 English Vovuh 2018-12-19 18:43:42 2574
en4 English Vovuh 2018-12-18 15:35:24 91
ru4 Russian Vovuh 2018-12-18 15:35:07 89
en3 English Vovuh 2018-12-18 14:43:21 112
ru3 Russian Vovuh 2018-12-18 14:42:23 101
en2 English Vovuh 2018-12-17 16:44:19 0 (published)
ru2 Russian Vovuh 2018-12-17 16:44:11 0 (опубликовано)
ru1 Russian Vovuh 2018-12-17 16:43:54 2328 Первая редакция перевода на Русский (сохранено в черновиках)
en1 English Vovuh 2018-12-17 16:42:23 2364 Initial revision (saved to drafts)