Hanoi final contest

3 problems from Hanoi final contest (contest 102458), difficulty -. 3/3 solutions verified against sample I/O.

3 items

Hanoi final contest

Special | 3 problems | 3/3 verified | Difficulty - | 13m 46s

#	Problem	Time	✓
A	Daniel and Perpendophobia	6m 30s	✓
B	Daniel and gameshow	2m 18s	✓
C	Daniel's game	4m 58s	✓

Practice › Codeforces Solutions › Hanoi final contest ›

CF 102458C - Daniel's game

We have an array A of n non-negative integers and a budget M. For every non-empty contiguous subarray A[l..r], Andy may increase its elements, but the total amount added cannot exceed M. His goal is to make the chosen subarray non-decreasing.

Practice › Codeforces Solutions › Hanoi final contest ›

CF 102458A - Daniel and Perpendophobia

The geometric story becomes much simpler if we look only at coordinates. Suppose Daniel has already recorded a point (u, v). A mine (x, y) must be avoided whenever x = u or y = v, because the segment joining the two points is then vertical or horizontal.

Practice › Codeforces Solutions › Hanoi final contest ›

CF 102458B - Daniel and gameshow

The graph is a tree because it has (n) vertices and exactly (n-1) edges while being connected. Every edge has a toughness (a), meaning Daniel may cross that edge at most (a) times during his turn. He chooses a starting vertex (R), or, when (R=0), he may choose any vertex.