2023 Hunan Provincal Multi-University Training (Xiangtan University)
11 problems from 2023 Hunan Provincal Multi-University Training (Xiangtan University) (contest 104414), difficulty -. 11/11 solutions verified against sample I/O.
2023 Hunan Provincal Multi-University Training (Xiangtan University)
Special | 11 problems | 11/11 verified | Difficulty - | 11m 28s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u5947\u8ff9 | 56s | ✓ | |||
| B | \u9636\u68af\u8ba1\u6570 | 1m 17s | ✓ | |||
| C | 01\u611f\u67d3 | 1m 4s | ✓ | |||
| D | \u8d26\u53f7 -1 | 55s | ✓ | |||
| E | \u6765\u81ea 2020 \u7684\u9c9c\u82b1 | 1m 1s | ✓ | |||
| F | \u65e0\u4ea7\u9636\u7ea7\u4e07\u5c81 | 57s | ✓ | |||
| G | \u5144\u5f1f\u6570 | 55s | ✓ | |||
| H | \u87f9\u9ec4\u5821\u548c\u6d77\u9738\u7cca | 1m 6s | ✓ | |||
| I | \u4e09\u5206\u56fe | 1m 16s | ✓ | |||
| J | Aythsr \u7684\u5f69\u7968\u4eba\u751f | 55s | ✓ | |||
| K | \u6469\u5929\u5927\u697c | 1m 6s | ✓ |
CF 104414K - 摩天大楼
We are given a one-dimensional street with $n$ positions, each position $i$ having a planned final height $hi$. Think of this as a skyline project where each index is a building site and the number $hi$ is how many “layers of construction” are required at that site.
CF 104414I - 三分图
We are given multiple test cases. Each test case describes three groups of vertices, with sizes $a$, $b$, and $c$. We imagine all vertices are initially isolated, and we are allowed to add undirected edges between any pairs of distinct vertices.
CF 104414A - 奇迹
We are given a grid of integers, and we are asked to count how many axis-aligned rectangles inside this grid satisfy a very specific condition based on their four corner values. For any rectangle, we pick two distinct rows and two distinct columns.
CF 104414H - 蟹黄堡和海霸糊
We are given two hidden positive integers $x$ and $y$. What we actually see is only their sum $n = x + y$ and the least common multiple $k = mathrm{lcm}(x, y)$. The task is to reconstruct one valid pair $(x, y)$ such that the sum matches $n$, the lcm matches $k$, and $x le y$.
CF 104414J - Aythsr 的彩票人生
We are given a connected undirected graph representing a city. Each road connects two intersections and may optionally contain a lottery machine. For each delivery request, a courier starts at a source node and wants to reach a target node along any walk in the graph.
CF 104414G - 兄弟数
We are given a number $x$ and a value range $[L, R]$. We want to pick a positive integer $y$ such that when we multiply it with $x$, the product becomes a perfect square. At the same time, that product must stay inside the interval $[L, R]$.
CF 104414F - 无产阶级万岁
We are given a tree with $n$ nodes. Only some nodes are leaves, and each leaf has a numeric value representing a “welfare expectation”. Internal nodes have value zero in the input, but they are structurally important because they define which leaves can communicate.
CF 104414E - 来自 2020 的鲜花
We are working with a star shaped graph with $n$ nodes, where one node acts as the center and the remaining $n-1$ nodes are leaves. Each leaf is associated with a fixed “original paint color”, and there are exactly $n-1$ distinct colors, one per leaf.
CF 104414B - 阶梯计数
We are given a staircase-shaped board of size $n$, where row $i$ contains exactly $i$ cells aligned to the left. So row 1 has 1 cell, row 2 has 2 cells, and so on up to row $n$ which has $n$ cells.