811.md (1850B)
1 Source: https://codeforces.com/blog/entry/52228 2 3 [811A - Vladik and Courtesy](/contest/811/problem/A "Codeforces Round 416 (Div. 2)") 4 5 **Hint** 6 7 Seriously? 8 9 **Tutorial** 10 11 Tutorial is loading... 12 13 [811B - Vladik and Complicated Book](/contest/811/problem/B "Codeforces Round 416 (Div. 2)") 14 15 **Hint** 16 17 Solution with *O*(*n* * *m* * *logn*) complexity is too slow? Probably we should sort faster? 18 19 **Tutorial** 20 21 Tutorial is loading... 22 23 **Challenge**. Can you solve the problem with *n*, *m* ≤ 106? 24 25 [811C - Vladik and Memorable Trip](/contest/811/problem/C "Codeforces Round 416 (Div. 2)") 26 27 **Hint 1** 28 29 Let's elaborate, when a segment can become a train carriage. 30 31 **Hint 2** 32 33 Try to use dynamic programming on prefix. 34 35 **Tutorial** 36 37 Tutorial is loading... 38 39 **Challenge**. Can you solve the problem with *n*, *a*[*i*] ≤ 105? Try to use the fact, that . 40 41 [811D - Vladik and Favorite Game](/contest/811/problem/D "Codeforces Round 416 (Div. 2)") 42 43 **Hint 1** 44 45 Try to solve problem, when buttons can't be broken. 46 47 **Hint 2** 48 49 Try to find out whether the buttons are broken somehow, without taking risk of losing. 50 51 **Tutorial** 52 53 Tutorial is loading... 54 55 **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. 56 57 [811E - Vladik and Entertaining Flags](/contest/811/problem/E "Codeforces Round 416 (Div. 2)") 58 59 **Hint** 60 61 Try to use interval tree. 62 63 **Tutorial** 64 65 Tutorial is loading...