2020 Lenovo Cup USST Campus Online Invitational Contest

13 problems from 2020 Lenovo Cup USST Campus Online Invitational Contest (contest 102623), difficulty -. 11/13 solutions verified against sample I/O.

13 items

2020 Lenovo Cup USST Campus Online Invitational Contest

Special | 13 problems | 11/13 verified | Difficulty - | 31m 2s

# Problem Rating Tags Accepted Time ✓
A Archmage 1m 27s ✓
B Bamboo Leaf Rhapsody 3m 11s ✓
C Cheat Sheet 1m 13s ✓
D Disaster Recovery 1m 45s
E Eight Digital Games 7m 34s ✓
F Fake Algorithm 1m 1s ✓
G Gentle Jena 6m 27s ✓
H Hay Mower 1m 49s ✓
I Immortal Trees 1m 22s ✓
J JXC!! 1m 34s
K K-Shift Array 1m 19s ✓
L Lottery Tickets 1m 5s ✓
M MITE 1m 15s ✓
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623H - Hay Mower

The farm is a grid where every cell has its own weed growth speed. A cell with value a[i][j] gains that many weed units every moment.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623D - Disaster Recovery

I can write the editorial, but the requested format is much longer than can fit in a single response. I will provide it in parts, keeping the required sections and continuing until the complete editorial is finished.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623M - MITE

We have a rectangular farm with at most 30 rows and only 8 columns. A cell is either blocked rock or usable sand. We may turn any sand cells into water. After choosing the water cells, every remaining sand cell that touches at least one water cell can grow sugar cane.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623K - K-Shift Array

We have an array of values. Two operations are mixed together: one operation rearranges a continuous part of the array, and the other asks for the sum of a continuous part. A K-shift is not a normal rotation of the whole interval.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623J - JXC!!

with the actual query strategy and code structure for Codeforces 102623J.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623I - Immortal Trees

We need count labeled trees on vertices 1..n that satisfy two kinds of restrictions. Some pairs of vertices are forced to be connected by an edge. Other restrictions limit the final degree of particular vertices from above or below.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623C - Cheat Sheet

The cheat sheet has a fixed capacity measured in characters. Setsuna has a collection of keywords, but repeated keywords only matter once because the final sheet cannot contain duplicates.
codeforces competitive-programming Aug 4, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623L - Lottery Tickets

We have a collection of digit cards. For every digit from 0 to 9, the input tells us how many copies of that digit exist. We may choose any subset of these cards and arrange the chosen digits into a decimal number.
codeforces competitive-programming Aug 2, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623E - Eight Digital Games

The game uses a string whose characters are eight possible symbols, numbered from 1 to 8. Every pair of positions where a larger digit appears before a smaller digit contributes a penalty. The amount of penalty depends only on the two digit values involved, through the matrix P.
codeforces competitive-programming Aug 2, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623B - Bamboo Leaf Rhapsody

The task is to find how quickly a message sent from the origin can reach at least one star. The stars are points in three-dimensional space, and the message travels in a straight line at speed one unit of distance per year.
codeforces competitive-programming Aug 2, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623G - Gentle Jena

We receive a sequence of star brightness values, but the sequence is generated online. After every new star appears, we need the value of the beauty of the current prefix.
codeforces competitive-programming Aug 1, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623F - Fake Algorithm

The task is a constructive attack against a deliberately bad grouping algorithm. We are not asked to find the best partition. Instead, for a given integer k, we must create up to 300 integers and a valid grouping of them.
codeforces competitive-programming Aug 1, 2026
Practice › Codeforces Solutions › 2020 Lenovo Cup USST Campus Online Invitational Contest ›

CF 102623A - Archmage

The Archmage starts with a full mana pool of size n. During each second, he may spend x mana to summon one Water Element if enough mana is available, or he may wait. After that decision, his aura restores y mana, but the mana cannot go above n.
codeforces competitive-programming Aug 1, 2026