2024湖南省赛

11 problems from 2024湖南省赛 (contest 105423), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2024湖南省赛

Special | 11 problems | 11/11 verified | Difficulty - | 11m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	\u8d2a\u5403\u86c7				1m 10s	✓
B	HolyK's Land				1m 22s	✓
C	easy math				51s	✓
D	Too much noise!				1m 3s	✓
E	\u62fc\u63a5\u4e32				49s	✓
F	\u9605\u8bfb\u7406\u89e3				1m 21s	✓
G	Utakotoba				1m 14s	✓
H	\u7ecf\u6587				57s	✓
I	\u6570\u636e\u68c0\u7d22\u7cfb\u7edf				59s	✓
J	Beautiful Sequence				47s	✓
K	\u6e21\u52ab				1m 3s	✓

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423E - 拼接串

We are given a long sequence of integers, each value lying between 1 and 18. From this sequence we are allowed to pick two contiguous subarrays, and then concatenate them in order to form a new sequence.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423K - 渡劫

We are given a connected undirected graph with $n$ islands and $m$ tunnels. Each island has a cost $ai$, representing the energy needed to perform a ritual if you are currently on that island. Each tunnel connects two islands and has a travel cost.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423J - Beautiful Sequence

We are given two permutations of the numbers from 1 to n. The task is to count how many sequences are simultaneously subsequences of both permutations, under a very specific structural constraint.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423I - 数据检索系统

We are building a simplified membership system that behaves like a hash-filtered set with multiple hash functions. The system stores elements in a binary array of size n, initially all zeros.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423H - 经文

We are given a target pattern string $s$ and we want to build strings of length $n$ using lowercase English letters. Inside each constructed string, we look for occurrences of $s$ as contiguous substrings.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423G - Utakotoba

We are given a line of n positions, each holding a 15-bit non-negative integer. We are allowed to perform an operation on any adjacent pair of positions.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423F - 阅读理解

We are given a tree that comes from a transformation process applied to some directed graph. The process runs a depth-first search, assigns discovery times, maintains a stack of vertices, and whenever a specific low-link condition is met it creates a new auxiliary node and…

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423D - Too much noise!

We are given a collection of signals. Each signal has two numeric attributes: an energy value and a frequency value. The task is to consider every ordered pair of signals and accumulate a cost defined by a product of two independent parts.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423B - HolyK's Land

We are given a tree of cities. Each query activates a consecutive block of “movie options”, and each option corresponds to selecting all cities along the unique tree path between two given endpoints.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423A - 贪吃蛇

We are given a set of points on a 2D plane, each representing a coin. A snake starts at the origin and can only move in two directions: right and up, meaning in whatever coordinate system we choose, its x coordinate and y coordinate never decrease along its path.

Practice › Codeforces Solutions › 2024湖南省赛 ›

CF 105423C - easy math

We are given a small list of numbers, each of which is a power of two. That means every element can be written as $2^{ki}$ where the exponent $ki$ is a small non-negative integer.