2022 CCPC Henan Provincial Collegiate Programming Contest

12 problems from 2022 CCPC Henan Provincial Collegiate Programming Contest (contest 103941), difficulty -. 11/12 solutions verified against sample I/O.

12 items

2022 CCPC Henan Provincial Collegiate Programming Contest

Special | 12 problems | 11/12 verified | Difficulty - | 12m 43s

# Problem Rating Tags Accepted Time ✓
A Mocha \u4e0a\u5c0f\u73ed\u5566 2m 3s
B Hash 1m 12s ✓
C Serval \u7684\u8bd5\u5377\u7b54\u6848 1m 14s ✓
D Mocha \u4e0a\u4e2d\u73ed\u5566 48s ✓
E Serval \u7684\u4ff3\u53e5 48s ✓
F \u96c6\u5408\u4e4b\u548c 47s ✓
G Mocha \u4e0a\u5927\u73ed\u5566 1m 19s ✓
H \u65cb\u8f6c\u6c34\u7ba1 47s ✓
I Oshwiciqwq \u7684\u7535\u68af 50s ✓
J Mex Tree 1m 20s ✓
K \u590d\u5408\u51fd\u6570 49s ✓
L \u4e32\u4e32\u4e32\u4e32\u2026\u2026 46s ✓
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941J - Mex Tree

We are given a tree with n nodes, and each node carries a distinct label from 0 to n − 1, so the labels form a permutation.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941L - 串串串串……

We are given a multiset of short strings, each up to length 5000 in total across all inputs. From these strings, we care about which longer strings “qualify” certain fragments. A fragment is a partition of a string t into consecutive pieces.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941K - 复合函数

We are given a function on the set of integers from 1 to n. Each number points to exactly one number in the same range, so the function can be seen as a directed graph where every node has exactly one outgoing edge. We are also given many queries.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941I - Oshwiciqwq 的电梯

We are given a three dimensional grid representing a building. Every point in this grid is a room identified by coordinates $(x, y, z)$. Movement inside this building is not done by walking, but by using special cyclic elevators.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941G - Mocha 上大班啦

We are given several binary strings, all of equal length. Think of them as a matrix with n rows and m columns, where each entry is either 0 or 1. Each row is a string, and each column is a bit position shared across all strings. We then perform a sequence of operations.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941H - 旋转水管

The problem gives a grid of size 4 by m. The top row contains exactly one entry point at column x, and water starts flowing downward from that cell. The bottom row contains exactly one exit point at column y, and it can only accept water flowing downward into it.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941F - 集合之和

We are working with finite sets of non-negative integers. Given a set $A$, we define the sumset $A + A$ as all values that can be formed by adding any two elements from $A$, with repetition allowed in the choice but duplicates removed in the result.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941E - Serval 的俳句

We are given a single long string made of lowercase English letters. From this string, we are allowed to delete characters and keep the remaining ones in order, forming a subsequence.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941A - Mocha 上小班啦

A Boolean function is sweet when every subtable arising from any prefix assignment is a bead. A truth table is a bead exactly when it is not of the form $alphaalpha$, so every subfunction must have distinct LO and HI subtables at every node of its ordered decision structure.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941D - Mocha 上中班啦

We are given a convex polygon that rotates rigidly around a fixed point, which is guaranteed to lie inside the polygon or on its boundary. Along with this, we are given two parallel lines that form an infinite strip.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941C - Serval 的试卷答案

We are given a string over the alphabet A, B, C, D that changes over time. Two operations are supported: we can cyclically increment every character in a range, and we can ask how many different “exam papers” could produce a given substring while using exactly k questions.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 CCPC Henan Provincial Collegiate Programming Contest ›

CF 103941B - Hash

We are given a circular string made only of four characters, each mapped to a small integer weight. The string is arranged in a ring, so after the last character we wrap back to the first.
codeforces competitive-programming Jul 2, 2026