2020 CCPC Henan Provincial Collegiate Programming Contest

12 problems from 2020 CCPC Henan Provincial Collegiate Programming Contest (contest 104095), difficulty -. 10/12 solutions verified against sample I/O.

12 items

2020 CCPC Henan Provincial Collegiate Programming Contest

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

# Problem Rating Tags Accepted Time ✓
A \u73ed\u59d4\u7ade\u9009 2m 41s ✓
B \u5e7f\u544a\u6295\u653e 48s ✓
C \u6211\u5f97\u91cd\u65b0\u96c6\u7ed3\u90e8\u961f 54s ✓
D \u56ed\u827a\u5927\u5e08 43s ✓
E \u53d1\u901a\u77e5 47s ✓
F \u65c5\u6e38\u80dc\u5730 53s ✓
G vvvvvvvim 53s ✓
H \u6797\u514b\u4e0e\u7ffb\u8f6c\u6392\u5217 1m 16s ✓
I \u592a\u9633\u8f70\u70b8 41s
J \u4e8c\u8fdb\u5236\u4e0e\u3001\u5e73\u65b9\u548c 57s ✓
K \u5b50\u4e32\u7ffb\u8f6c\u56de\u6587\u4e32 36s
L \u9001\u5916\u5356 1m 3s ✓
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095L - 送外卖

There are up to 14 locations connected by an undirected weighted graph. Each location has one delivery order that becomes available at a specific time. You start at node 1 at time 0 and move along roads at unit speed, so traveling along an edge takes time equal to its weight.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095K - 子串翻转回文串

The problem statement in your prompt is incomplete because the PDF text has been corrupted during extraction. The crucial part describing the samples is missing, and more importantly, the statement does not include the official solution logic.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095H - 林克与翻转排列

We are given two sequences, each a permutation of the integers from 1 to n. Think of them as an initial arrangement and a target arrangement. The only allowed operation is to pick a contiguous block of exactly k elements in the current array and reverse the order of that block.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095I - 太阳轰炸

The problem statement in your prompt is incomplete for writing a correct editorial and solution. The crucial mathematical definition is missing: the statement only says that a missile "hits" if its damage circle intersects the target circle, but it does not include the full…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095J - 二进制与、平方和

We are maintaining an array of integers where each value fits in a fixed 24-bit range. The system must support two operations over subarrays.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095G - vvvvvvvim

We are given two rectangular text layouts, but each row is not stored as a raw string. Instead, each row is described in a compressed form as blocks of repeated characters. For example, a row like aaabccc is given as (a,3),(b,1),(c,3).
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095A - 班委竞选

Each student either competes for exactly one position or none of them matter for a given position. For every position, we must look at all students who applied for that position and select the one with the highest vote count.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095F - 旅游胜地

We are given a connected undirected graph with up to one hundred thousand vertices and edges. Every vertex has two possible values: a normal value and a discounted value. For each vertex, we must choose exactly one of these two values as its final weight.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095D - 园艺大师

We are given a row of $n$ plants, each starting with the same height $h$. For each plant, we are allowed to either keep it unchanged or cut it down to any integer height strictly less than $h$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095E - 发通知

We are given a set of students, each associated with a time interval during which they are actively checking messages. If a notification is sent at some chosen moment, a student receives it only if that moment lies inside their personal interval.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095C - 我得重新集结部队

We are simulating a sequence of events on a 2D battlefield. Two kinds of entities appear over time: bugs and warriors. Bugs spawn at fixed coordinates with a given health.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2020 CCPC Henan Provincial Collegiate Programming Contest ›

CF 104095B - 广告投放

We are given a sequential process with n episodes, and an initial audience size m. Each episode may or may not run an advertisement.
codeforces competitive-programming Jul 2, 2026