The 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)
12 problems from The 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei) (contest 104857), difficulty -. 12/12 solutions verified against sample I/O.
The 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 10m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | SQRT Problem | 46s | ✓ | |||
| B | Queue Sorting | 1m 7s | ✓ | |||
| C | Cyclic Substrings | 55s | ✓ | |||
| D | Balanced Array | 1m 20s | ✓ | |||
| E | Matrix Distances | 45s | ✓ | |||
| F | Colorful Balloons | 36s | ✓ | |||
| G | Streak Manipulation | 52s | ✓ | |||
| H | Computational Complexity | 1m 4s | ✓ | |||
| I | Linguistics Puzzle | 47s | ✓ | |||
| J | Takeout Delivering | 50s | ✓ | |||
| K | Campus Partition | 51s | ✓ | |||
| L | Information Spread | 55s | ✓ |
CF 104857L - Information Spread
We are given a directed graph where each vertex represents a student and each directed edge represents a possible way information can be passed from one student to another.
CF 104857K - Campus Partition
We are given a tree representing a campus, where each node is a building and each building has a positive importance value. We must split the tree into several groups by removing some edges.
CF 104857J - Takeout Delivering
We are given a connected undirected graph where each edge has a positive weight representing congestion. A path from node 1 to node n is not evaluated in the usual way. Instead of summing all edge weights, only the two largest edge weights along the path matter.
CF 104857I - Linguistics Puzzle
We are given a strange “language system” where there are $n$ symbols and they behave like digits in a base-$n$ number system, but the mapping from digits to symbols is unknown.
CF 104857H - Computational Complexity
We are given two mutually recursive functions that grow with the input size, but instead of depending on slightly smaller integers in a linear way, each function depends on the other function evaluated at a significantly smaller argument, specifically a halved version of the…
CF 104857G - Streak Manipulation
We are given a binary string that represents attendance across a sequence of classes. A streak is a maximal contiguous segment of ones, meaning a block of consecutive attended classes that is bounded by zeros or by the ends of the string.
CF 104857D - Balanced Array
We are given an array that grows one element at a time, and after each new element we must decide whether the current prefix has a certain structural property.
CF 104857F - Colorful Balloons
We are given a sequence of balloon colors, where each balloon has a color represented by a short lowercase string. The task is to determine whether there exists a color that appears strictly more than half of the total number of balloons. If such a color exists, we output it.
CF 104857E - Matrix Distances
We are given an $n times m$ grid where each cell contains an integer color. For every color, we look at all cells having that color and consider every ordered pair of such cells.
CF 104857B - Queue Sorting
We are given a multiset of integers where values range from 1 to n, and each value i appears ai times. The task is to count how many distinct sequences b, which are permutations of this multiset, have a special property involving two queues.
CF 104857C - Cyclic Substrings
We are given a circular string of digits. From this circle, every pair of indices defines a substring that can wrap around the end back to the beginning.
CF 104857A - SQRT Problem
We are given three integers: a modulus $n$, and two residues $a$ and $b$, all positive, with $n$ odd and $gcd(a,n)=1$. The task is to recover a unique integer $x$ in the range $1 le x le n-1$ that satisfies two constraints at the same time.