The 2019 ICPC China Shaanxi Provincial Programming Contest

12 problems from The 2019 ICPC China Shaanxi Provincial Programming Contest (contest 104460), difficulty -. 9/12 solutions verified against sample I/O.

12 items

The 2019 ICPC China Shaanxi Provincial Programming Contest

ICPC/IOI | 12 problems | 9/12 verified | Difficulty - | 14m 42s

# Problem Rating Tags Accepted Time ✓
A Digit Mode 2m 3s
B Grid with Arrows 1m ✓
C 0689 1m 14s ✓
D Pick Up 53s ✓
E Turn It Off 47s ✓
F K-hour Clock 1m 9s ✓
G Paper-cutting 52s ✓
H To the Park 1m 57s
I Unrooted Trie 56s ✓
J Coolbits 1m 6s ✓
K Escape Plan 47s ✓
L Digit Product 1m 58s
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460L - Digit Product

There isn’t enough consistent information here to actually diagnose a “logic bug,” because the “input” you’re giving is not a well-formed instance of any single Codeforces problem.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460K - Escape Plan

We are given an undirected weighted graph where each vertex represents a location in a city and each edge represents a bidirectional road with a travel time. BaoBao starts at node 1 and wants to reach any of a set of exit nodes.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460J - Coolbits

We are given several independent intervals, and from each interval we must choose exactly one integer. After making all choices, we compute the bitwise AND of all selected numbers. The goal is to maximize this final AND value.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460H - To the Park

There isn’t enough consistent information here to actually diagnose a “logic bug,” because the “input” you’re giving is not a well-formed instance of any single Codeforces problem.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460I - Unrooted Trie

We are given a tree where every edge carries a lowercase letter. If we choose a vertex as a root, every vertex defines a string formed by reading edge labels along the unique path from the root to that vertex.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460F - K-hour Clock

We are observing a cyclic time system where time does not run on the usual 24-hour clock but instead wraps around after an unknown number of hours, call it $k$. In this system, time advances by one hour as usual, except that after reaching $k-1$, it wraps back to 0.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460G - Paper-cutting

We are given a binary grid representing a piece of paper made of unit squares. Each cell is either 1, meaning it remains in the final artwork, or 0, meaning it must be removed. Before cutting, we are allowed to fold the grid multiple times along horizontal or vertical grid lines.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460A - Digit Mode

There isn’t enough consistent information here to actually diagnose a “logic bug,” because the “input” you’re giving is not a well-formed instance of any single Codeforces problem.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460E - Turn It Off

We are given a binary array representing a row of lights, where each position is either on or off. We are allowed to perform an operation that chooses a starting index and flips off a contiguous segment of fixed length $L$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460D - Pick Up

We are working on an infinite grid where movement is restricted to the unit streets formed by all vertical and horizontal integer lines. Distance is therefore Manhattan distance, since every path must follow grid edges. There are three relevant points.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460C - 0689

We are given a string made only from digits 0, 6, 8, and 9. We perform exactly one operation: choose a contiguous segment, reverse it, and then replace every digit in that reversed segment using a 180-degree rotation rule, where 0 maps to 0, 8 maps to 8, and 6 and 9 swap with…
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2019 ICPC China Shaanxi Provincial Programming Contest ›

CF 104460B - Grid with Arrows

We are given a directed grid where each cell contains two pieces of information: a direction (up, down, left, or right) and a positive jump length.
codeforces competitive-programming Jun 30, 2026