Tiangong University 2025 ICPC Team Selection Contest II (Online Mirror)
13 problems from Tiangong University 2025 ICPC Team Selection Contest II (Online Mirror) (contest 106396), difficulty -. 13/13 solutions verified against sample I/O.
Tiangong University 2025 ICPC Team Selection Contest II (Online Mirror)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 5s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u72fc | 45s | ✓ | |||
| B | \u732b | 57s | ✓ | |||
| C | \u5f71\u5b50\u620f | 1m 18s | ✓ | |||
| D | \u6076\u4e0e\u997f | 1m 6s | ✓ | |||
| E | \u68a6\u60f3 | 53s | ✓ | |||
| F | \u6597\u95ef\u5c06 | 39s | ✓ | |||
| G | \u72fc\u4e0e\u826f | 55s | ✓ | |||
| H | \u70df\u706b\u62fe\u7a57 | 51s | ✓ | |||
| I | \u4e0d\u89c1 | 1m 17s | ✓ | |||
| J | \u6e56\u4e2d\u56de\u7738 | 45s | ✓ | |||
| K | \u5171\u6b7b | 41s | ✓ | |||
| L | \u798f\u7984\u5bb4 | 1m 8s | ✓ | |||
| M | \u540c\u751f | 50s | ✓ |
CF 106396M - 同生
We are working with a dynamic system of elements that behave like nodes in a graph, where nodes can be merged over time into larger components.
CF 106396D - 恶与饿
We are given a sequence of numbers and asked to compute a global value that depends on all increasing subsequences inside it.
CF 106396E - 梦想
We are given two integer arrays of the same length. Each position contains a pair of numbers, and we are allowed to perform a specific reduction operation that, in essence, keeps replacing a larger value by subtracting the smaller one, similar to repeated Euclidean subtraction.
CF 106396K - 共死
We are given a list of integers and a threshold value $k$. From this list, we are interested in how “close” any two elements can get under the XOR operation.
CF 106396H - 烟火拾穗
The problem gives a weighted graph with a designated starting node. We are allowed to move along edges, and the cost of moving between any two nodes is defined by the shortest path distance in the original graph.
CF 106396J - 湖中回眸
We are given two binary grids of the same size, each cell containing a value that can be interpreted as either 0 or 1. The task is to transform the first grid into the second grid using a specific type of operation: choosing a cell (or position) and flipping its value.
CF 106396A - 狼
We are given a collection of items, each with an integer weight. There is also an initial offset value, which behaves like a starting balance in the system. The process begins from this offset, and each item can be chosen at most once.
CF 106396L - 福禄宴
We are given a set of points on a 2D plane. The task is to choose two vertical lines, meaning lines of the form $x = c1$ and $x = c2$, and also implicitly a horizontal line $y = c3$, so that the plane is split into four rectangular regions.
CF 106396G - 狼与良
We are looking at a stochastic process over positions labeled from 0 to n - 1. At each step, the system redistributes probability mass across these positions using a fixed transition rule, so the state is always a probability distribution over the n positions.
CF 106396C - 影子戏
We are given a rectangular board with dimensions $n times m$. Each cell can be interpreted as a position where we may place a chess piece, and the problem asks for the maximum number of pieces we can place under a movement restriction that comes from a knight-like attack rule.
CF 106396I - 不见
We are given a simple undirected graph where each vertex carries a value. Along with the graph structure, the task involves applying a sequence of allowed operations on vertices and edges to eventually isolate and “extract” a special value, while also producing a concrete…
CF 106396F - 斗闯将
The task is essentially a direct comparison between two integers. Each test case provides two numbers, and the output depends only on their relative ordering. If both values are identical, the result is a draw.
CF 106396B - 猫
We are given a weighted undirected graph. Each edge connects two vertices and carries a cost. The task is to select a set of edges that connects all vertices together, forming a single connected structure, while maximizing the total sum of chosen edge weights.