The 18th Heilongjiang Provincial Collegiate Programming Contest

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

12 items

The 18th Heilongjiang Provincial Collegiate Programming Contest

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

#	Problem	Time	✓
A	Magic Computer	52s	✓
B	Chevonne's Game	1m 4s	✓
C	Compass	1m 12s	✓
D	Pandemic	1m 4s	✓
E	Ethernet	48s	✓
F	Folder	48s	✓
G	Gravity	50s	✓
H	KingZ	1m 7s	✓
I	Club	1m 16s	✓
J	XOR String	1m 8s	✓
K	Turn-based Game	1m 17s	✓
L	Subxor	54s	✓

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

CF 104363K - Turn-based Game

We are simulating a sequence of battles where each battle consists of fighting a small group of identical monsters. Each monster has a fixed amount of health, and every attack reduces the chosen monster’s health by exactly one.

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

CF 104363L - Subxor

We are given an array of integers and a fixed integer $K$. For each query, we look at a subsegment of the array, from index $l$ to $r$, and we want to choose a contiguous subarray inside this segment that maximizes its length under a constraint on XOR.

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

CF 104363J - XOR String

We are given a circular string, so substrings are allowed to wrap from the end back to the beginning. Each position in this circle has a lowercase character and an associated integer value.

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

CF 104363I - Club

We are given a collection of n clubs, and we must assign each club one of m badge types. Multiple clubs can share the same badge type, but every badge type must appear at least once. After the assignment is fixed, a participant repeatedly visits clubs.

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

CF 104363H - KingZ

We are given a fixed 10×10 board where each cell represents a battlefield tile. Some cells are walls and cannot be used. Every other cell may initially contain a number of troops and also belongs to a category such as core, keep, lawn, or neutral territory.

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

CF 104363G - Gravity

We are given a set of points in the plane, each representing an asteroid of equal mass. We must split these points into two nonempty groups.

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

CF 104363F - Folder

We are given a rooted tree where each node represents a folder. Folder 1 is fixed as the root, and every other folder has exactly one parent. So the structure is a hierarchy of directories.

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

CF 104363D - Pandemic

We are asked to count how many valid “distribution plans” Kanade can follow while serving a row of $n$ rooms arranged in a line. The process always moves strictly from left to right, never revisiting rooms.

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

CF 104363E - Ethernet

We are simulating a very small randomized process on a fixed set of ports and cables, where each cable ultimately ends up plugged into exactly one port. There are n ports labeled from 1 to n and n cables also labeled from 1 to n.

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

CF 104363C - Compass

We are dealing with a system of three rotating components. Each component has a position on a circular scale, and each full rotation brings it back to the starting point after a fixed number of steps. The twist is that we do not directly choose how much each component rotates.

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

CF 104363B - Chevonne's Game

We are given a binary string representing a row of pearls, where each pearl is either white or black. The system supports two operations over time. One operation flips the colors of all pearls in a range, turning white into black and black into white.

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

CF 104363A - Magic Computer

We are given a process involving a collection of USB disks, where each disk initially holds a unique file. The computer has a very unusual constraint: at any moment, it only interacts with the two most recently inserted disks, and when two disks are inserted together they…