2025广东工业大学新生赛(决赛)

14 problems from 2025广东工业大学新生赛(决赛) (contest 106239), difficulty -. 14/14 solutions verified against sample I/O.

14 items

2025广东工业大学新生赛(决赛)

Special | 14 problems | 14/14 verified | Difficulty - | 12m 28s

#	Problem	Time	✓
A	\u6781\u5dee\u6700\u5927\u7684\u533a\u95f4	56s	✓
B	\u9b54\u6cd5\u68cb\u76d8	52s	✓
C	\u533a\u95f4\u4e58	1m 9s	✓
D	\u73af\u7403\u65c5\u884c\u5546	1m 12s	✓
E	\u8d28\u6570\u53d8\u5316	45s	✓
F	\u5b87\u5b99\u5c04\u7ebf\u98ce\u66b4	53s	✓
G	\u4e07\u80fd\u77e9\u9635	1m 6s	✓
H	\u80fd\u91cf\u6c47\u805a	47s	✓
I	\u6bd4\u8f83\u5927\u5c0f	52s	✓
J	\u534f\u4f1a\u7684\u5b9e\u9a8c	47s	✓
K	\u7ebf\u6bb5\u8986\u76d6	46s	✓
L	\u6c14\u7403\u91c7\u8d2d	49s	✓
M	\u654c\u4eba\u7684\u654c\u4eba	51s	✓
N	\u6700\u5927\u5316\u4eff\u5c04\u53d8\u6362	43s	✓

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239N - 最大化仿射变换

We are given a collection of affine transformations of a single integer variable, all starting from zero. Each operation takes the current value of $x$ and replaces it with $ai x + bi$, where both coefficients are non-negative integers.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239E - 质数变化

We are given multiple independent queries. Each query provides two prime numbers, both strictly less than 10000, and we treat them as four-digit numbers by padding with leading zeros when necessary.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239K - 线段覆盖

We are given a sorted list of distinct points on a number line. The task is to cover all these points using at most $k$ segments, where a segment can be any interval $[a,b]$ and its cost is its geometric length $ A useful way to reframe the problem is to think of grouping points.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239G - 万能矩阵

We are asked to construct a square grid of size $2n times 2n$ filled with non-negative integers. Each cell value must not exceed $n^4$. The requirement is extremely strong: every integer $K$ from $1$ to $n^4$ must appear as the sum of some axis-aligned submatrix of this grid.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239L - 气球采购

We are given a set of $n$ different problem types, each associated with an expected probability ratio $pi / qi$ that models how many participants are expected to solve that problem.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239I - 比较大小

We are given several independent test cases. In each test case there is an unknown array of up to 100 non-negative integers, each value at most $10^{18}$. We are not allowed to see the array directly.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239C - 区间乘

We are given a sequence of positive integers and asked to answer multiple independent queries. Each query provides a target value $x$, and we must determine whether there exists a contiguous subarray whose elements multiply together exactly to $x$.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239A - 极差最大的区间

We are given a sequence of integers and asked to choose a contiguous segment so that the difference between the largest and smallest element inside that segment is as large as possible.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239H - 能量汇聚

We are standing on a line of positions labeled from 0 to n. Position 0 is the start and has no reward, while every position from 1 to n contributes a fixed energy value if we land on it. We begin at position 0 and want to reach position n. Movement is constrained in two ways.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239D - 环球旅行商

The map consists of rows from 0 to n+1 and columns from 1 to m. Rows 0 and n+1 represent the north pole and south pole. Every supply point lies inside rows 1...n. From a cell (x,y) we may move south to (x+1,y), or move left and right inside the same row.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239M - 敌人的敌人

We are given a collection of countries, where each country is a node in a graph and every direct enemy relationship is an edge.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239J - 协会的实验

We are given a sequence of operations that gradually builds a string starting from empty. Each operation inserts exactly one character, but the insertion is not always at the same position.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239F - 宇宙射线风暴

The plane contains a square region from $0$ to $N$ on both axes. Inside this region, we are given many infinite straight lines, each carrying a weight. Every line is either of slope $+1$, written as $y = x + b$, or slope $-1$, written as $y = -x + c$.

Practice › Codeforces Solutions › 2025广东工业大学新生赛(决赛) ›

CF 106239B - 魔法棋盘

We are given a 1000 by 1000 grid with a fixed checkerboard coloring. Cell (x, y) is white when x + y is even, and black otherwise.