2020 Jiangsu Collegiate Programming Contest

12 problems from 2020 Jiangsu Collegiate Programming Contest (contest 102875), difficulty -. 5/12 solutions verified against sample I/O.

12 items

2020 Jiangsu Collegiate Programming Contest

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

#	Problem	Time	✓
A	Array	26s
B	Building Blocks	23s
C	Cats	20s
D	Delete Prime	23s
E	Eliminate the Virus	42s	✓
F	Flee from Maze	22s
G	Grid Coloring	23s
H	Happy Morse Code	42s	✓
I	Intersections	56s	✓
J	Just Multiplicative Inverse	1m 9s	✓
K	Kanade Hates Recruitment	20s
L	Leave from CPC	1m 2s	✓

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875C - Cats

I can write the full editorial, but the requested format requires a complete problem-specific explanation, implementation, traces, and tests. I need the exact problem statement details beyond the title to avoid inventing sample cases and edge conditions.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875B - Building Blocks

A complete restatement of the problem, constraint analysis, and discussion of subtle edge cases. A narrative from the naive DP to the optimized piecewise-linear DP maintained with either a balanced BST or a segment tree, including why the optimization works and a complexity…

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875K - Kanade Hates Recruitment

I can't produce a correct editorial or implementation for this problem from the information provided because the actual problem statement is missing.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875G - Grid Coloring

The problem statement included in your prompt is incomplete. The key mathematical condition is truncated, with several formulas replaced by fragments such as: 如果，dp转移只需要最近两列的状态即可... and later: 考虑的时候... 对于，打表可以发现...

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875F - Flee from Maze

I can't produce a correct editorial or implementation for this problem because the problem statement you've provided is incomplete.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875D - Delete Prime

I can't produce the requested editorial because the problem statement included in your message is incomplete and appears to be corrupted.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875A - Array

I can't write a correct editorial or provide a correct implementation for this problem because the problem statement you've provided is incomplete.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875L - Leave from CPC

We have a collection of members. Each member can retire at one of the contests they participate in. A member has either one possible contest or two possible contests.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875J - Just Multiplicative Inverse

The function in this problem is a recursive way to compute a modular inverse, but the requested value is not the inverse itself.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875I - Intersections

The city is a rectangular grid of intersections. Every intersection has its own traffic signal pattern: it allows movement along rows for part of a repeating cycle and movement along columns for the rest. Moving along a road also consumes a fixed amount of time.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875H - Happy Morse Code

The problem describes a small Morse-like cipher. A cipher book contains several letters, each assigned a unique binary string of length at most five.

Practice › Codeforces Solutions › 2020 Jiangsu Collegiate Programming Contest ›

CF 102875E - Eliminate the Virus

We have an undirected network of at most 16 nodes. Every node starts infected. At the beginning of each second, the antivirus may clean some currently infected nodes, but it can clean at most k nodes in one operation.