Codeforces Round 930 (Div. 2)

Solutions for Codeforces Round 930 (Div. 2) (contest 1937). 3/6 problems verified against sample I/O. Difficulty range: 800-3100.

6 items

Codeforces Round 930 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-3100 | Time: 13m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Shuffle Party	800	implementation, math	1m 48s	✓
B	Binary Path	1300	dp, greedy, implementation	3m 39s	✓
C	Bitwise Operation Wizard	1700	bitmasks, constructive-algorithms, interactive	3m 9s	✗
D	Pinball	2000	binary-search, data-structures, implementation	2m	✗
E	Pok\u00e9mon Arena	2400	graphs, shortest-paths, sortings	1m 18s	✓
F	Bitwise Paradox	3100	data-structures, two-pointers	1m 34s	✗

Practice › Codeforces Solutions › Codeforces Round 930 (Div. 2) ›

CF 1937F - Bitwise Paradox

We are given two integer arrays, a and b, of length n, along with a fixed integer v. We are asked to process queries of two types. The first type updates a single element in b.

Practice › Codeforces Solutions › Codeforces Round 930 (Div. 2) ›

CF 1937B - Binary Path

We have a grid with exactly two rows and n columns. Every cell contains either 0 or 1. The path always starts at the top-left cell and ends at the bottom-right cell.

Practice › Codeforces Solutions › Codeforces Round 930 (Div. 2) ›

CF 1937E - Pokémon Arena

We can think of this problem as walking through a sequence of Pokémon, where each Pokémon is a node with a cost to “enter combat” and several strength values across different attributes.

Practice › Codeforces Solutions › Codeforces Round 930 (Div. 2) ›

CF 1937C - Bitwise Operation Wizard

We are interacting with a hidden permutation of numbers from 0 to n-1, but we never see it directly. Instead, we are allowed to compare expressions of the form (p[a] Our goal is not to reconstruct the permutation, but to find two indices i and j such that the XOR of their…

Practice › Codeforces Solutions › Codeforces Round 930 (Div. 2) ›

CF 1937D - Pinball

We are given a line of cells, each cell containing a direction character that behaves like a deterministic instruction for a moving token. When a token is dropped onto a cell, it repeatedly moves one step left or right depending on the current cell’s character.

Practice › Codeforces Solutions › Codeforces Round 930 (Div. 2) ›

CF 1937A - Shuffle Party

We are asked to track the position of the number 1 in a special sequence of swaps on an array of length n. Initially, the array is [1, 2, 3, ..., n]. For every k from 2 to n, we swap ak with ad, where d is the largest proper divisor of k.