Udmurtia High School Programming Contest (Qualification for VKOSHP 2012)
12 problems from Udmurtia High School Programming Contest (Qualification for VKOSHP 2012) (contest 105579), difficulty -. 12/12 solutions verified against sample I/O.
Udmurtia High School Programming Contest (Qualification for VKOSHP 2012)
Special | 12 problems | 12/12 verified | Difficulty - | 12m 1s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Traffic Light | 51s | ✓ | |||
| B | Knight's Revenge | 47s | ✓ | |||
| C | The Thermotaur Labyrinth | 49s | ✓ | |||
| D | Fibonacci Grouping | 1m 10s | ✓ | |||
| E | Uniform Square Tiling | 1m 11s | ✓ | |||
| F | Optimal Arithmetic Sequence | 50s | ✓ | |||
| G | Minecraft | 1m 4s | ✓ | |||
| H | The Hard Question | 1m 12s | ✓ | |||
| I | Dormitory Mapping | 48s | ✓ | |||
| J | Kings' Dominion | 1m 3s | ✓ | |||
| K | Dima and Petya's Caf\u00e9 | 1m 15s | ✓ | |||
| L | Optimal Milk Temperature | 1m 1s | ✓ |
CF 105579L - Optimal Milk Temperature
We are given a sequence of milk batches, each batch has two attributes. The first is a coefficient $bi$ which represents how much flavor Vova gains per unit of heating temperature.
CF 105579H - The Hard Question
We are given a small system of boys and girls where each boy has a fixed list of girls he is willing to dance with. The process is conceptual rather than simulated: boys go in increasing order, and each boy tries to pick a girl he likes who is still available.
CF 105579J - Kings' Dominion
We are given positions of several kings placed on a 100 by 100 grid. In one action, we choose a single king and start moving it step by step in any of the eight directions, so every move changes its cell to one of the adjacent squares including diagonals.
CF 105579E - Uniform Square Tiling
We are given an $n times n$ grid representing a tiled wall. Each cell contains either a gold tile, written as G, or a silver tile, written as S. We are also given an integer $k$, and we want to choose a contiguous $k times k$ sub-square of this grid.
CF 105579D - Fibonacci Grouping
We are given a line of $n$ people indexed from 1 to $n$. The process repeatedly forms a group from the current line by selecting all positions whose indices are Fibonacci numbers.
CF 105579K - Dima and Petya's Café
The city is a rectangular grid of blocks formed by a set of horizontal streets and vertical avenues. Each intersection of streets and avenues defines a block, and every block contains a known number of potential customers. Two cafes must be placed in two different blocks.
CF 105579A - Traffic Light
We are simulating a simple driving scenario on a straight road. A car starts some distance away from an intersection and moves toward it at a constant speed. At a certain future time, a traffic light at the intersection will turn red for a fixed duration.
CF 105579G - Minecraft
We are given a vertical cross-section of a Minecraft world represented as an $h times w$ grid. Each cell is either empty, a dirt block, or a gold block.
CF 105579B - Knight's Revenge
We are given a fixed 10 by 10 chessboard-like grid. Each cell is either empty or contains an enemy. The task is to choose exactly one empty cell as a starting position. From that position, we consider all cells that a chess knight can reach in a single move.
CF 105579I - Dormitory Mapping
We are given a connected undirected graph with n vertices and m edges. The vertices are already labeled with a “new” numbering from 1 to n, which is fixed in the input.
CF 105579F - Optimal Arithmetic Sequence
We start from the number 1 and are given a multiset of small arithmetic operations. Each operation is a pair consisting of one of four symbols and a digit from 1 to 9.
CF 105579C - The Thermotaur Labyrinth
The labyrinth can be viewed as an $N times N$ grid where each cell has a unique integer temperature. From any cell, a minotaur is allowed to move to one of the four adjacent cells if it chooses.