2023湖南省赛

10 problems from 2023湖南省赛 (contest 104611), difficulty -. 10/10 solutions verified against sample I/O.

10 items

2023湖南省赛

Special | 10 problems | 10/10 verified | Difficulty - | 10m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	\u5f00\u5f00\u5fc3\u5fc3233				44s	✓
B	square game				1m 5s	✓
C	\u5ba4\u6e29\u8d85\u5bfc				1m 27s	✓
D	Container Orders				53s	✓
E	ytree				52s	✓
F	\u5b9d\u77f3\u4ea4\u6613				57s	✓
G	\u5957\u5a03\u6536\u7eb3				1m 17s	✓
I	hard math				51s	✓
J	radius				50s	✓
K	\u6bd5\u4e1a\u5b63				1m 23s	✓

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611A - 开开心心233

We are simulating a very small “playlist system” that evolves over a sequence of operations. At any moment there is a queue of songs waiting to be performed. Two kinds of operations happen in order.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611G - 套娃收纳

We are given a collection of items, each described by two values $li$ and $ri$. You can think of each item as a container: it has an inner capacity $l$ and an outer size $r$.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611E - ytree

We are given a rooted tree with nodes numbered from 1 to N, where node 1 is fixed as the root. Each node starts with an implicit weight, initially zero. The system supports three kinds of operations that affect or query values on the tree.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611C - 室温超导

We are given two strings, one called $S$ and another called $T$. We construct new strings by taking a non-empty substring from $S$, say $S[i..j]$, and then attaching a suffix of $T$, say $T[k..m]$, to its right.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611J - radius

We are given a set of points in three-dimensional space. Each point has integer coordinates, and there are up to ten thousand of them. We want to place a sphere whose center is constrained to lie somewhere on one of the coordinate axes, meaning on the x-axis, y-axis, or z-axis.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611K - 毕业季

We are given a small undirected graph with up to 20 vertices. A traveler starts at any vertex and moves for exactly d days. Each day consists of taking one edge to a neighboring vertex, so the sequence of visited vertices has length d.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611I - hard math

We are given two very large integers, $L$ and $R$, both written with exactly $n$ decimal digits. The task is to count how many integers $X$ lie in the inclusive range $[L, R]$ such that when we look at the decimal representation of $X$, the number of distinct digits appearing…

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611F - 宝石交易

We are given two circular sequences of gemstones, both of length n. Each position holds a gemstone type, and the sequences are considered cyclic, meaning we can choose any starting point and traverse them in a fixed direction around the circle.

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611D - Container Orders

We are given a collection of containers, each container having a fixed weight of 2 and an associated cost. Each container is not unique in structure, but each input line describes a group of identical containers: a count $ki$ and a cost $Wi$, meaning there are $ki$ containers…

Practice › Codeforces Solutions › 2023湖南省赛 ›

CF 104611B - square game

We are given several independent piles of stones. Each pile starts with some positive number of stones, and two players alternate moves.