2019-2020 ICPC Asia Hong Kong Regional Contest

11 problems from 2019-2020 ICPC Asia Hong Kong Regional Contest (contest 102452), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2019-2020 ICPC Asia Hong Kong Regional Contest

ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 45m 37s

#	Problem	Time	✓
A	Axis of Symmetry	4m 16s	✓
B	Binary Tree	56s	✓
C	Constructing Ranches	3m 40s	✓
D	Defining Labels	6m 17s	✓
E	Erasing Numbers	1m 45s	✓
F	Falling Objects	2m 59s	✓
G	Game Design	1m 57s	✓
H	Hold the Line	6m 28s	✓
I	Incoming Asteroids	8m 39s	✓
J	Junior Mathematician	3m 56s	✓
K	Key Project	4m 44s	✓

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452B - Binary Tree

We have a rooted binary tree with node 1 as its root. Alice and Bob alternately remove one subtree. A move is legal only when the removed subtree is a perfect full binary tree, meaning every internal node has exactly two children and all leaves are at the same depth.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452C - Constructing Ranches

Each shop is a vertex of a tree, and shop (i) sells exactly one fence segment of length (ai). Choosing two shops (x) and (y) means taking every segment on the unique tree path between them.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452K - Key Project

We have two groups of m engineers, algorithm engineers and software engineers. Each engineer is located in one of n buildings and has an individual assignment cost.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452F - Falling Objects

Each object is one of three convex solids: a cube, a sphere, or a regular tetrahedron. Its size, orientation, and horizontal release position are given. The objects are released one at a time, and each one falls only vertically.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452E - Erasing Numbers

We have an odd-length array of distinct integers. An operation chooses three consecutive current elements and replaces those three elements by their median, so the array becomes shorter by two.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452J - Junior Mathematician

For every positive integer x, look at its decimal digits. If those digits are d1, d2, ..., dk, define f(x) as the sum of di dj over every pair of different positions with i < j. We need to count the integers in [L, R] for which x and f(x) have the same remainder modulo m.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452I - Incoming Asteroids

We maintain one nondecreasing counter for every observatory. A member joins at some point in time, chooses at most three distinct observatories, and asks for a total of at least y minutes from those observatories.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452H - Hold the Line

We have an array of (N) trenches. A trench is initially empty, and each trench can receive a soldier at most once. When a soldier is placed at position (x), that position permanently gets a height (h). A query gives a position interval ([L,R]) and an enemy height (H).

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452G - Game Design

We have to construct a rooted tree whose root represents the base. Every leaf contains a monster, and that monster travels toward the root.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452D - Defining Labels

The labels form an ordered sequence of strings. For a chosen base (k), exactly (k) decimal digits are allowed: (10-k, 11-k, ldots, 9). Labels are first ordered by length, and within the same length they are ordered lexicographically using those allowed digits.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Hong Kong Regional Contest ›

CF 102452A - Axis of Symmetry

We have a collection of axis-aligned rectangles whose interiors never overlap. Rectangles may touch along edges or at points, so the final figure can be one connected shape, several disconnected shapes, or a shape with holes.