Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)

Solutions for Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) (contest 1994). 0/8 problems verified against sample I/O. Difficulty range: 800-3500.

8 items

Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)

Type: Div. 1+2 | Problems: 8 | Verified: 0/8 | Rating range: 800-3500 | Time: 26m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Diverse Game	800	constructive-algorithms, greedy, implementation	5m 16s	✗
B	Fun Game	1100	bitmasks, constructive-algorithms, greedy	5m 22s	✗
C	Hungry Games	1600	binary-search, dp, two-pointers	2m 42s	✗
D	Funny Game	1900	constructive-algorithms, dsu, graphs	1m 36s	✗
E	Wooden Game	2000	bitmasks, greedy, math	1m 28s	✗
F	Stardew Valley	2500	constructive-algorithms, dfs-and-similar, graphs	2m 32s	✗
G	Minecraft	2600	bitmasks, brute-force, dp	5m 13s	✗
H	Fortnite	3500	combinatorics, constructive-algorithms, games	2m 4s	✗

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994G - Minecraft

We are given a fixed array of integers and a target value, and we are allowed to choose a single non-negative integer x. The operation applied to the array is simple: we XOR every element of the array with x, then sum the results.

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994H - Fortnite

The first problem asks whether an infinite sequence of perfect squares $(an^2)$ can exist such that each term starting from the third satisfies the Fibonacci-type recurrence $an^2 = a{n-1}^2 + a{n-2}^2.

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994F - Stardew Valley

Codeforces 1994F: Stardew Valley

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994E - Wooden Game

We are given several independent forests, where each forest consists of multiple rooted trees. Every tree has a fixed root at vertex 1, and each vertex defines a natural subtree consisting of itself and all descendants in this rooted structure.

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994B - Fun Game

We are given two binary sequences of equal length, s and t. Vanya can perform a specific operation on s repeatedly: he chooses a contiguous subarray from position l to r, and for each position i in that subarray, replaces s[i] with s[i] XOR s[i - l + 1].

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994A - Diverse Game

We are given a grid that already contains every integer from 1 to $n cdot m$ exactly once, arranged in some arbitrary order. The task is to construct another grid of the same dimensions using the same set of numbers such that no number stays in its original cell.

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994D - Funny Game

We are asked to construct a connected graph on $n$ vertices, starting from an empty graph, by performing $n-1$ operations. Each operation is numbered from 1 to $n-1$.

Practice › Codeforces Solutions › Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) ›

CF 1994C - Hungry Games

We are given a row of values, and we want to count how many contiguous segments behave “well” under a very specific simulation rule. When we pick a segment $[l, r]$, we process its elements from left to right, maintaining a running sum $g$.