2021年中国大学生程序设计竞赛女生专场

11 problems from 2021年中国大学生程序设计竞赛女生专场 (contest 103389), difficulty -. 8/11 solutions verified against sample I/O.

11 items

2021年中国大学生程序设计竞赛女生专场

Special | 11 problems | 8/11 verified | Difficulty - | 11m 57s

#	Problem	Time	✓
A	\u516c\u4ea4\u7ebf\u8def	50s	✓
B	\u653b\u9632\u6f14\u7ec3	1m 1s	✓
C	\u8fde\u9501\u5546\u5e97	2m 18s
D	\u4fee\u5efa\u9053\u8def	43s	✓
E	\u88ab\u9057\u5fd8\u7684\u8ba1\u5212	53s	✓
F	\u5730\u56fe\u538b\u7f29	43s	✓
G	3G\u7f51\u7edc	28s
H	4G\u7f51\u7edc	2m 31s
I	\u9a7e\u9a76\u5361\u4e01\u8f66	52s	✓
J	\u6700\u5927\u6743\u8fb9\u72ec\u7acb\u96c6	57s	✓
K	\u97f3\u4e50\u6e38\u620f	41s	✓

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389H - 4G网络

Let $alpha = a1 a2 dots an$ be a permutation of ${1,dots,n}$. Let $pi$ denote the inverse permutation, so $pi(ai)=i$. The inversion table from Section 7.2.1.2 is defined by $cj = {, i : pi(i) pi(j), i < j }, qquad 1 le j le n,$ so $0 le cj < j$.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389K - 音乐游戏

The task is essentially about processing a stream of text tokens and extracting a very specific character statistic from them. Instead of performing any structural parsing or transformation, we read all input strings and focus only on occurrences of the hyphen character -.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389J - 最大权边独立集

We are working with a weighted tree and we want to select a set of edges such that no two chosen edges share an endpoint. This is the classical edge independent set condition, which is equivalent to a matching on a tree. Each chosen edge contributes its weight to the total score.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389I - 驾驶卡丁车

The task is essentially a step by step simulation problem involving a kart that follows a sequence of driving instructions. You are given an initial state of the kart and then a list of commands.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389G - 3G网络

The problem statement for “Codeforces 103389G - 3G网络” is missing from your prompt, so there’s no way to reliably reconstruct the task or produce a correct editorial.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389C - 连锁商店

Let vertices be all binary strings $a{2t-1}dots a1a0$ with exactly $t$ zeros and $t$ ones. A move consists of choosing some index $j in {1,dots,2t-1}$ and swapping $a0$ with $aj$, producing a new string that still has $t$ zeros and $t$ ones.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389F - 地图压缩

We are given a rectangular grid of characters, and the task is to determine how much the grid can be compressed by periodic repetition in both dimensions.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389E - 被遗忘的计划

We are given two integer sequences that describe a kind of composition process. One sequence can be thought of as a base transformation, and the other is the result after applying that transformation multiple times.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389D - 修建道路

We are given a sequence of integers, where each position can be interpreted as a node in a line, and the value at each position represents a weight or height associated with that node.

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389B - 攻防演练

We are given a fixed string s of length n, and multiple queries. Each query gives a segment [l, r] inside s. For each segment, we are asked to construct a new string t that is as short as possible while still failing to appear as a subsequence of s[l..r].

Practice › Codeforces Solutions › 2021年中国大学生程序设计竞赛女生专场 ›

CF 103389A - 公交线路

We are given a bus route with a fixed ordered list of stops. A passenger reports a sequence of stops they observed while riding the bus, but there is a complication: the bus might be traveling in the forward direction of the route or in the reverse direction.