Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Codeforces Round #595 (Div. 3) Editorial

Revision en3, by vovuh, 2019-10-24 12:56:09

All ideas belong to MikeMirzayanov.

1249A - Yet Another Dividing into Teams

Tutorial
Solution

1249B1 - Books Exchange (easy version)

Tutorial
Solution

1249B2 - Books Exchange (hard version)

Tutorial
Solution

1249C1 - Good Numbers (easy version)

Tutorial
Solution

1249C2 - Good Numbers (hard version)

Tutorial
Solution

1249D1 - Too Many Segments (easy version)

Tutorial
Solution

1249D2 - Too Many Segments (hard version)

Tutorial
Solution

1249E - By Elevator or Stairs?

Tutorial
Solution

1249F - Maximum Weight Subset

Thanks to neal for the additional editorial of this problem and providing the linear solution!

Tutorial
Solution (Vovuh, n^3)
Solution (PikMike, n^2)
Tags codeforces, 595, third division, editorial

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English vovuh 2019-10-24 12:56:09 159
ru2 Russian vovuh 2019-10-24 12:55:11 148
en2 English vovuh 2019-10-22 22:43:39 2 (published)
ru1 Russian vovuh 2019-10-22 22:43:33 10164 Первая редакция перевода на Русский
en1 English vovuh 2019-10-22 22:42:18 10194 Initial revision (saved to drafts)