The 20th Hangzhou City University Programming Contest

13 problems from The 20th Hangzhou City University Programming Contest (contest 104282), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 20th Hangzhou City University Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 12m 2s

#	Problem	Time	✓
A	Zawei The Rock	44s	✓
B	Emoji Master BSQ	55s	✓
C	Genshin Master	52s	✓
D	Add 9 Zeros \u2161	1m 4s	✓
E	XOR on Tree	1m 1s	✓
F	Crazy Thursday, V me 50!	49s	✓
G	Domino	57s	✓
H	Maze	1m	✓
I	Magic Tree	50s	✓
J	Disjoint-Set-Union Sum	1m 9s	✓
K	Equal Difference Prime	54s	✓
L	Auto Chess	1m	✓
M	Jiubei and Construction	47s	✓

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282M - Jiubei and Construction

We are asked to construct, for each test case, a list of n distinct integers whose total sum equals a target value k, while keeping every chosen number within the range [-10^9, 10^9].

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282L - Auto Chess

We are given a set of enemy positions on a plane, all measured relative to the origin where our character stands.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282J - Disjoint-Set-Union Sum

We start with an array of $n$ numbers. Initially, each element stands alone as a separate segment. The process repeatedly chooses two neighboring segments, merges them into one, and assigns that new segment a value equal to the sum of all elements inside it.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282K - Equal Difference Prime

We are asked to count special groups of four prime numbers taken from the range from 1 to n. Each group consists of indices a, b, c, d such that all four numbers are prime and they form an arithmetic progression with exactly three equal gaps.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282I - Magic Tree

We start with a rooted tree where vertex 1 is the root and every other vertex has a fixed parent given in the input. Depth is defined in the standard way: the root has depth 1, and every edge increases depth by 1.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282H - Maze

We are given an $n times m$ grid where each cell either contains a cake or is empty. The task is to eat all cakes while maximizing total satisfaction. There are two possible actions. One action eats a single cake and gives a fixed reward $p$.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282G - Domino

We are given a collection of domino cards. Each card carries two values, a front value and a back value. From the full set of cards, we first select exactly K cards. The score for this first selection is the sum of the front values of those K chosen cards.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282F - Crazy Thursday, V me 50!

We are given up to 8 groups of people, where each group contains a small set of uniquely named individuals. Some individuals appear in multiple groups. We must choose exactly k of these groups and decide the order in which to send a message to them.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282E - XOR on Tree

We are given a rooted tree where vertex 1 is the root. Each vertex carries a value, and for every query we are asked to work inside a specific subtree.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282D - Add 9 Zeros Ⅱ

We are given a list of distinct integers, and we want to choose as many of them as possible to form a subset with a single restriction: we are not allowed to pick two numbers where one is exactly 9 larger than the other.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282B - Emoji Master BSQ

We are given a fixed dictionary of word replacements. Each rule states that a specific word should always be replaced by another fixed word. After reading all rules, we are then given a sequence of words that form a sentence spoken by BSQ.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282C - Genshin Master

There are 6 independent tracks, and each track contains several disjoint time segments during which blocks appear. Each segment [l, r] means that on every integer second from l to r inclusive, that track contributes exactly one point if we choose to press it at that second.

Practice › Codeforces Solutions › The 20th Hangzhou City University Programming Contest ›

CF 104282A - Zawei The Rock

The task is extremely direct. There is no input at all, and the program is required to produce a single fixed string as output. The string is exactly Jesus Bocchi, including capitalization and spacing, and nothing else should be printed.