2022 International Collegiate Programming Contest, Jinan Site

13 problems from 2022 International Collegiate Programming Contest, Jinan Site (contest 104076), difficulty -. 10/13 solutions verified against sample I/O.

13 items

2022 International Collegiate Programming Contest, Jinan Site

Special | 13 problems | 10/13 verified | Difficulty - | 14m 44s

# Problem Rating Tags Accepted Time ✓
A Tower 49s ✓
B Torch 48s ✓
C DFS Order 2 1m 10s
D Frozen Scoreboard 53s ✓
E Identical Parity 56s ✓
F Grid Points 2m 3s
G Quick Sort 48s ✓
H Set of Intervals 1m 31s ✓
I Shortest Path 53s ✓
J Skills 2m 7s
K Stack Sort 56s ✓
L Tree Distance 1m 3s ✓
M Best Carry Player 47s ✓
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076M - Best Carry Player

We are given multiple test cases. In each one, we receive a list of positive integers. These numbers are added sequentially into an accumulator, starting from zero, but the order of addition is not fixed. We are allowed to reorder the list before performing the sum.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076J - Skills

Let $f(x1,ldots,xn)$ have truth table $tau$, and let $f^Z$ have truth table $tau^Z$. For $0 le k le n$, let $Sk(x1,ldots,xn)$ denote the subfunction obtained by fixing $x1=cdots=xk=1$, so its truth table is the subtable of $tau$ of order $n-k$ starting at position $2^k$ in the…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076L - Tree Distance

We are given a weighted tree with nodes labeled from 1 to n. Between any two nodes, there is a unique simple path, and the distance between two nodes is the sum of edge weights along that path. Each query gives an interval of labels, from l to r.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076K - Stack Sort

We are given a permutation of the integers from 1 to n. We read the numbers from left to right and, as we see each number, we must immediately place it onto one of m stacks.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076I - Shortest Path

We are given a weighted undirected graph and two special vertices, vertex 1 as the start and vertex n as the destination.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076H - Set of Intervals

We start with a collection of intervals. Each interval represents a continuous range on the number line. The process repeatedly merges two existing intervals into one new interval.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076F - Grid Points

Let $f(x1,ldots,xn)$ have truth table $tau$, and let $f^Z$ have truth table $tau^Z$. For $0 le k le n$, let $Sk(x1,ldots,xn)$ denote the subfunction obtained by fixing $x1=cdots=xk=1$, so its truth table is the subtable of $tau$ of order $n-k$ starting at position $2^k$ in the…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076G - Quick Sort

We are given a deterministic quicksort implementation that always chooses the middle element of the current segment as the pivot and uses a Hoare-style partition procedure.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076E - Identical Parity

We are given a permutation of numbers from 1 to n and a fixed segment length k. For every contiguous block of length k inside the permutation, we compute its sum.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076D - Frozen Scoreboard

We are given a contest with up to 1000 teams and at most 13 problems. For each team, we know two kinds of information that must be made consistent. The first is the final official result: how many problems the team solved and the total penalty time across those solved problems.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076C - DFS Order 2

Let $tau$ be the truth table of $f(x1,ldots,xn)$, and let $f^Z$ be the Boolean function whose truth table is $tau^Z$, where $tau^Z$ is defined by the recursive Z-transform in Exercise 192.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076A - Tower

We are given a collection of tower heights, where each tower has an integer height. Before doing anything else, we are allowed to permanently delete exactly $m$ towers.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 International Collegiate Programming Contest, Jinan Site ›

CF 104076B - Torch

Two people are walking through a narrow cave in a fixed order. The first person, Pang, is always ahead, and the second person, Shou, follows exactly one unit behind at the start.
codeforces competitive-programming Jul 2, 2026