The 17th Heilongjiang Provincial Collegiate Programming Contest

12 problems from The 17th Heilongjiang Provincial Collegiate Programming Contest (contest 103688), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 17th Heilongjiang Provincial Collegiate Programming Contest

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

#	Problem	Time	✓
A	Bookshelf Filling	1m 2s	✓
B	Lovely Fish	1m 20s	✓
C	Tree Division	57s	✓
D	Collision Detector	1m 8s	✓
E	Exclusive Multiplication	1m 11s	✓
F	342 and Xiangqi	54s	✓
G	Chevonne's Necklace	52s	✓
H	Kanbun	50s	✓
I	Equal Sum Arrays	44s	✓
J	JOJO's Happy Tree Friends	1m 11s	✓
K	Monkey Joe	52s	✓
L	Let's Swap	1m 6s	✓

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688J - JOJO's Happy Tree Friends

We are given a rooted tree with nodes labeled from 1 to n, with node 1 as the root. A token starts on some node, and the process evolves in discrete steps. In each step, we pick a node v uniformly at random from all n nodes.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688L - Let's Swap

We are given a string and a target string of the same length. In one operation, we pick one of two allowed cut positions, split the string into a prefix and suffix, then perform a specific sequence of rearrangement: swap the two parts and reverse the whole result.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688K - Monkey Joe

We are given a tree with a value attached to every node. A “path query” here is not just about summing node values along a path.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688H - Kanbun

We are given a sequence of words indexed from 1 to n, and alongside it a string of the same length consisting of three possible characters: opening parentheses, closing parentheses, and dashes. The parentheses form a correctly matched structure.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688G - Chevonne's Necklace

We are given a circular arrangement of n pearls. Each pearl i has a non-negative integer value ci. The process is interactive in the sense that we repeatedly choose a starting pearl i, but only if ci is at least 1 and there are enough pearls currently still present.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688I - Equal Sum Arrays

We are asked to count how many different ordered arrays of positive integers sum up to a given number $k$. Order matters, so $[1,2]$ and $[2,1]$ are considered different, even though they have the same sum.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688F - 342 and Xiangqi

There are only seven possible positions on a small board. Two identical pieces start on two different positions among these seven, and the goal is to move them, one move at a time, until they occupy two other distinct target positions.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688E - Exclusive Multiplication

We are given an array of integers, and for every pair of indices $i < j$, we compute a derived value from the product of the two numbers after stripping away even prime exponents in a very specific way.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688D - Collision Detector

We are given three fixed points in the plane, each representing the center of a unit circle (radius is 1 for every ball). One ball starts at $O1$ and we are allowed to choose its initial velocity vector arbitrarily.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688B - Lovely Fish

We are given a binary string. Each character describes whether a coworker likes Fish or not. For any query, we take a contiguous substring and are allowed to insert any number of 1s at arbitrary positions.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688A - Bookshelf Filling

We are given two types of books that behave identically in width when placed upright: every book occupies exactly one unit of shelf width. The difference is in height. Type A books have height a, and type B books are taller with height b, where a < b.

Practice › Codeforces Solutions › The 17th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103688C - Tree Division

We are given a tree with n nodes, and each node carries an integer value. We fix node 1 as a special root candidate, and we need to decide whether it is possible to partition all nodes into two disjoint groups A and B such that a monotonic constraint holds along every simple…