2024 Fujian Normal University Programming Contest

12 problems from 2024 Fujian Normal University Programming Contest (contest 105168), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2024 Fujian Normal University Programming Contest

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

#	Problem	Time	✓
A	Crazy Yesterday	36s	✓
B	Solo Leveling	58s	✓
C	Chain Reaction	1m 8s	✓
D	XOR Pairing	39s	✓
E	Cyber Hide-and-Seek	42s	✓
F	Double Holding	36s	✓
G	Color Contagion	49s	✓
H	Seeking Allies	50s	✓
I	Aeroplane Chess	44s	✓
J	Shifting Tournament	44s	✓
K	Uniform Dispersion	48s	✓
L	Terabyte Connection	53s	✓

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168C - Chain Reaction

We are given a system of $n$ lamps and $n$ buttons indexed from 1 to $n$. All lamps start turned off. Pressing button $i$ flips the state of every lamp whose index is divisible by $i$, so it affects a regular arithmetic structure over the lamps rather than a local segment.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168E - Cyber Hide-and-Seek

We are given a tree rooted at node 1, and a hidden target node $x$. The only way to learn about $x$ is through interactive queries.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168L - Terabyte Connection

We are given a set of independent file chunks that behave like delayed-start tasks. Each chunk becomes available for connection at a specific moment $pi$, and once we start downloading that chunk, it takes exactly $ti$ seconds to finish.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168K - Uniform Dispersion

We are given a set of points on a 2D plane. The task is to place exactly $k$ vertical lines and $k$ horizontal lines so that no line passes through any point, and these lines partition the plane into $(k+1)times(k+1)$ rectangular regions.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168J - Shifting Tournament

We are given a tournament with $2^k$ teams labeled from 1 to $2^k$. The competition runs in rounds, and each round pairs adjacent teams in the current ordering, eliminates one from each pair, and keeps the survivors in order for the next round.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168I - Aeroplane Chess

We are simulating a stochastic movement on a line segment labeled from 1 to n, with a special absorbing condition at position 0 that represents the end of the game.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168H - Seeking Allies

We are given a line of people, initially with no relationships between any pair. Over time, we are given a sequence of constraints.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168G - Color Contagion

We are given a rooted tree where vertex 1 is already colored at the start. All other vertices begin uncolored. A move consists of choosing any uncolored vertex whose parent in the rooted tree is already colored, and coloring it immediately.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168F - Double Holding

We are given two independent sequences of time intervals, one per track in a rhythm game. Each interval represents a “hold note”, meaning during that time range the player must keep a finger pressed on that track. A single finger is enough to handle a hold on one track.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168D - XOR Pairing

We are given several independent test cases. In each test case, there is an array of integers and a target value $k$.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168B - Solo Leveling

We are simulating a progression system where a character starts with two independent attributes, A and B, both initially fixed at 10. There are n monsters, and each monster i can only be defeated if the character has at least ai in A and at least bi in B.

Practice › Codeforces Solutions › 2024 Fujian Normal University Programming Contest ›

CF 105168A - Crazy Yesterday

We are given a sequence of queries, where each query tells us what day of the week “today” is, encoded as an integer from 1 to 7. The mapping is fixed: 1 corresponds to Monday, 2 to Tuesday, and so on until 7 corresponds to Sunday.