Codeforces Round #416 Editorial (with hints)

Revision en2, by hloya_ygrt, 2017-05-28 16:14:25

811A - Vladik and Courtesy

Hint
Tutorial

811B - Vladik and Complicated Book

Hint
Tutorial

Challenge. Can you solve the problem with n, m ≤ 106?

811C - Vladik and Memorable Trip

Hint 1
Hint 2
Tutorial

Challenge. Can you solve the problem with n, a[i] ≤ 105? Try to use the fact, that .

811D - Vladik and Favorite Game

Hint 1
Hint 2
Tutorial

Challenge. Assume this problem: let's change all dangerous cells on walls, i.e such cells, in which it is just impossible to enter. Now you have to generate such string from moves 'L', 'R', 'U', 'D', that without dependance on possible button breakage of pairs 'L'/'R' and 'U'/'D', as in original problem, will visit finish cell. Of course, it is not necessary to stop at finish cell, you just have to visit it at least once.

811E - Vladik and Entertaining Flags

Hint
Tutorial

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
ru3 Russian hloya_ygrt 2017-05-28 16:15:25 21
en2 English hloya_ygrt 2017-05-28 16:14:25 1588
en1 English hloya_ygrt 2017-05-28 16:12:49 1772 Initial revision for English translation
ru2 Russian hloya_ygrt 2017-05-28 16:05:55 2 (опубликовано)
ru1 Russian hloya_ygrt 2017-05-28 15:55:25 1770 Первая редакция (сохранено в черновиках)