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

12 problems from 2022年中国大学生程序设计竞赛女生专场 (contest 104081), difficulty -. 9/12 solutions verified against sample I/O.

12 items

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

Special | 12 problems | 9/12 verified | Difficulty - | 12m 43s

# Problem Rating Tags Accepted Time ✓
A \u51cf\u80a5\u8ba1\u5212 58s ✓
B \u7ffb\u65b0\u9053\u8def II 46s
C \u6d4b\u91cf\u5b66 55s ✓
D Devil May Cry 1m 25s
E \u7761\u89c9 1m 7s ✓
F \u4f4d\u8fd0\u7b97\u8c1c\u9898 48s ✓
G \u6392\u961f\u6253\u5361 55s ✓
H \u63d0\u74e6\u7279\u4e4b\u65c5 1m 1s ✓
I \u5ba0\u7269\u5bf9\u6218 2m 3s
J \u745e\u58eb\u8f6e 1m 1s ✓
K \u533a\u95f4\u548c 46s ✓
L \u5f69\u8272\u7684\u6811 58s ✓
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081L - 彩色的树

We are given a rooted tree with nodes labeled from 1 to n. Each node has a color. The tree is rooted at node 1, so every node has a well-defined subtree consisting of itself and all its descendants. We are also given several queries.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081I - 宠物对战

I can write the full editorial, but I need the actual problem statement in a clean, uncorrupted form first. Right now the statement you pasted is heavily broken by formatting loss (missing variables, constraints, and most importantly the exact definitions of the three…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081K - 区间和

We are given an array of length $n$, and every element is a non-negative integer. From this array we consider every contiguous subarray, and each subarray has a weight equal to the sum of its elements.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081J - 瑞士轮

We are simulating a 32-team Swiss-system tournament where each match produces a winner and a loser according to fixed pairwise win probabilities derived from team strengths. Each team starts at state 0 wins and 0 losses.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081H - 提瓦特之旅

We are given a weighted undirected graph and a traveler who wants to move from a fixed starting node to a fixed destination node. Each edge has a travel time.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081G - 排队打卡

We are given a discrete-time queueing system where time is divided into seconds. At the start of some seconds, new people arrive and join the end of a queue. At the end of every second, a fixed number of people are admitted from the front of the queue and leave the system.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081D - Devil May Cry

I can write the full editorial, but I need the actual problem statement in a clean, uncorrupted form first. Right now the statement you pasted is heavily broken by formatting loss (missing variables, constraints, and most importantly the exact definitions of the three…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081E - 睡觉

We are tracking a single scalar state that changes once per second while a music track is played in an infinite loop. The track has length $n$, and each second produces a fixed “loudness” value from this period.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081F - 位运算谜题

We are given nine integers for each test case, but their meaning is partially hidden. Behind them are three unknown non-negative integers, call them $a$, $b$, and $c$. For every pair among these three numbers, we are told three bitwise results: XOR, OR, and AND.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081A - 减肥计划

We are given a line of people, each with a fixed weight, and a game that repeatedly compares people at the front of the line. In each round, the first two people in the queue compete. The heavier one wins the round.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081C - 测量学

We are looking at a geometric navigation problem in a circular campus layout. Everything is organized around a central library, with several concentric circular roads (think of them as rings).
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022年中国大学生程序设计竞赛女生专场 ›

CF 104081B - 翻新道路 II

Connection interrupted. Waiting for the complete answer
codeforces competitive-programming Jul 2, 2026