Ural Championship 2014

12 problems from Ural Championship 2014 (contest 105583), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Ural Championship 2014

Special | 12 problems | 12/12 verified | Difficulty - | 12m 57s

#	Problem	Time	✓
A	Assemble the Tower	57s	✓
B	Bank	57s	✓
C	Christmas Tree	1m 5s	✓
D	Delicious Pizza	1m 18s	✓
E	Expression	59s	✓
F	Fashionable Tiles	1m 10s	✓
G	Game with XORs	1m	✓
H	Harvest	1m 8s	✓
I	Innovative String Conversion	1m 6s	✓
J	Jeerman	53s	✓
K	Keen Coal Extraction	58s	✓
L	Lightbulbs	1m 26s	✓

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583K - Keen Coal Extraction

We are given a mine shaped like a rooted tree of shafts, where shaft 1 sits at the very top and every other shaft has exactly one connection upward that leads to a unique parent. Because of this structure, between any two shafts there is exactly one simple path.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583I - Innovative String Conversion

We are given a single string of length $N$ that is currently in state $A$, and we want to transform it into a target state $B$. Each position holds either a lowercase letter or a dot. A dot represents an empty cell.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583E - Expression

We are given a hidden arithmetic expression built from the numbers 1 through N, each used exactly once and arranged in some unknown order. Between consecutive numbers there are operators chosen from plus, minus, and multiplication.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583D - Delicious Pizza

We are given points on the boundary of a unit circle. Each point is specified by an angle, and these points represent available endpoints for straight cuts inside the circle.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583H - Harvest

We are given a tree where each node represents a tree in a plantation and each node initially contains some number of mango batches. Two people operate on this tree: Bob and Alice.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583L - Lightbulbs

We are given a collection of switches and lightbulbs, but the wiring is hidden. Each switch is connected to exactly one bulb, and each bulb has at least one switch attached.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583J - Jeerman

We are asked to construct a string of fixed length $N$, using lowercase English letters, such that it “contains” as many different given pattern words as possible. A pattern is considered present if it appears as a contiguous substring anywhere in the constructed string.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583F - Fashionable Tiles

We are asked to fill an $N times N$ grid with integers from $1$ to $N$. Each integer appears exactly $N$ times, so the grid is perfectly balanced across colors.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583G - Game with XORs

We are given a multiset of integers. Two players, Kolya and Mitya, alternate picking numbers from this set, with Kolya starting first. After all numbers are taken, each player computes the bitwise XOR of the numbers they collected.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583A - Assemble the Tower

We are building a vertical structure made of repeated modular pieces. Each unit of height is a layer, and each layer consumes a fixed number of identical bricks. Layers are grouped into blocks, and each block has a color.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583B - Bank

We are given a long binary string that was originally a concatenation of many bank transfer records. Each record consists of three binary numbers written back to back: a sender identifier, a recipient identifier, and a transfer amount.

Practice › Codeforces Solutions › Ural Championship 2014 ›

CF 105583C - Christmas Tree

We are given a cylindrical “tree” unwrapped into an $N times M$ grid. Each cell can hold at most one ornament. We must place ornaments so that every contiguous block of $W$ columns, taken across all $N$ rows, contains at least $S$ placed ornaments in total.