Udmurt SU + Izhevsk STU Contest 2012

10 problems from Udmurt SU + Izhevsk STU Contest 2012 (contest 104609), difficulty -. 8/10 solutions verified against sample I/O.

10 items

Udmurt SU + Izhevsk STU Contest 2012

Special | 10 problems | 8/10 verified | Difficulty - | 8m 37s

#	Problem	Time	✓
A	Busy Bees	54s	✓
B	Convex Polygon	56s	✓
C	Hexagonal Billiards	41s
D	Circular Sequence	51s	✓
E	Largest Triangle	58s	✓
F	Urns and Balls	1m 4s	✓
G	Puzznic	53s	✓
H	Emergency	45s
I	Easter Eggs	51s	✓
J	Cranes	44s	✓

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609J - Cranes

We have a straight line of positions numbered from 0 to m. All boxes initially sit at position 0, and the goal is to get all k boxes to position m. There are n cranes, all starting at position 0. Time advances in discrete seconds.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609I - Easter Eggs

We are given a row of $n$ positions, initially all distinguishable. Each position will eventually hold one painted egg, and each egg is colored using one of $k$ available colors. A full arrangement is therefore a length-$n$ sequence over an alphabet of size $k$.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609G - Puzznic

The board is a very small grid, at most 7 by 7, filled with three kinds of cells: walls, empty spaces, and numbered tiles from 1 to 9. Each number represents a tile type, and tiles of the same number interact with each other according to adjacency.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609H - Emergency

We are given a small grid of rooms, each room having up to four possible exits corresponding to the four cardinal directions.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609D - Circular Sequence

We are given a sequence arranged in a circle, meaning index 1 is adjacent to index N. Each position carries a value, and we want to pick a subset of indices that maximizes the sum of chosen values.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609F - Urns and Balls

We start with an array of size $n$ where each position initially contains exactly one ball, and that ball is uniquely identified by its starting position.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609E - Largest Triangle

We are given the vertices of a strictly convex polygon in counterclockwise order. From these vertices, we are allowed to pick any three distinct vertices and form a triangle.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609B - Convex Polygon

We are given a convex polygon with vertices in counterclockwise order. Each vertex has fixed coordinates, but during the process we are allowed to temporarily remove and later restore vertices.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609A - Busy Bees

We are given a set of positions in an infinite hexagonal grid, where each position contains a group of worker bees. Movement happens along shared edges of hex cells, and the cost between two cells is the minimum number of such moves required to travel between them.

Practice › Codeforces Solutions › Udmurt SU + Izhevsk STU Contest 2012 ›

CF 104609C - Hexagonal Billiards

We are simulating a billiard ball inside a regular hexagon where motion is perfectly elastic: the ball travels in straight lines and reflects off edges with equal incidence and reflection angles.