Open Udmurtia High School Programming Contest 2015

11 problems from Open Udmurtia High School Programming Contest 2015 (contest 105580), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Open Udmurtia High School Programming Contest 2015

Special | 11 problems | 11/11 verified | Difficulty - | 11m 5s

#	Problem	Time	✓
A	Forks	1m 4s	✓
B	Producer	47s	✓
C	Mosaic	54s	✓
D	Cakes	1m 1s	✓
E	Millionaire	55s	✓
F	Volume	43s	✓
G	Metro	1m 11s	✓
H	Domino	53s	✓
I	Satelite Internet	48s	✓
J	Maze	1m 22s	✓
K	Knights	1m 27s	✓

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580J - Maze

The task is an interactive exploration problem on a hidden rectangular grid of size at most 30 by 30. Each cell in the grid has four potential neighbors in the cardinal directions, so the underlying structure is the full grid graph.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580K - Knights

We are given a rooted tree of courtiers where node 1 is the king. Every other node has exactly one parent, so the structure is a rooted tree with edges directed away from the king. We must choose a subset of nodes to be “knights”.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580A - Forks

We are given five collections, each collection containing exactly five integers. Each integer describes a fork by the number of tines it has. Two forks are considered identical if their integer labels match. A “set” here is really a multiset of five integers.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580E - Millionaire

We maintain an array of bank balances indexed from 1 to N. Initially each account already contains some integer amount, and then we must process a sequence of operations that modify or query this array. There are two update operations and one query operation.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580G - Metro

We are given an undirected graph describing a metro system, and we must decide whether it can be generated by a very rigid geometric construction. The construction has a distinguished central station.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580H - Domino

We are given a set of domino pieces placed on a number line. Each piece sits at an integer coordinate and has a height.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580D - Cakes

We are given a sequence of cakes, each cake requiring three distinct fillings in a fixed order. There are only three possible filling types, labeled 1, 2, and 3, so every cake is a permutation of these three values.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580C - Mosaic

We are given a rectangular grid of lowercase letters, where each letter represents a colored tile. The task is to locate a subrectangle whose set of colors satisfies a very rigid combinatorial constraint: exactly K distinct colors appear, and if we count how many times each of…

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580I - Satelite Internet

We are given a set of satellites, each represented as a point in the upper half-plane, and a train route that is a horizontal segment on the x-axis. There is also a single obstacle segment representing a cloud.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580F - Volume

We are given a system that produces a total “volume”, initially at some value $M$. We want to adjust a set of $N$ independent regulators so that the final volume becomes exactly $V$.

Practice › Codeforces Solutions › Open Udmurtia High School Programming Contest 2015 ›

CF 105580B - Producer

We are given three parallel lists, each of length $N$, representing musicians of three different roles: guitarists, bassists, and drummers. Each musician has a skill value, and we must form exactly $N$ groups, where each group contains one person from each role.