Codeforces Round 966 (Div. 3)

Solutions for Codeforces Round 966 (Div. 3) (contest 2000). 4/8 problems verified against sample I/O. Difficulty range: 800-2200.

8 items

Codeforces Round 966 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 4/8 | Rating range: 800-2200 | Time: 31m 59s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Primary Task	800	implementation, math, strings	2m 37s	✓
B	Seating in a Bus	800	two-pointers	3m 24s	✗
C	Numeric String Template	1000	data-structures, strings	2m 36s	✓
D	Right Left Wrong	1200	greedy, implementation, two-pointers	6m 4s	✗
E	Photoshoot for Gorillas	1400	combinatorics, data-structures, greedy	1m 42s	✓
F	Color Rows and Columns	1900	dp, greedy, implementation	4m 4s	✓
G	Call During the Journey	2100	binary-search, brute-force, graphs	6m 3s	✗
H	Ksyusha and the Loaded Set	2200	binary-search, brute-force, data-structures	5m 29s	✗

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000H - Ksyusha and the Loaded Set

We are maintaining a dynamic set of integers drawn from a bounded universe up to about two million. Elements can be inserted and removed, and after each modification we may be asked a query about the structure of the “holes” in the set.

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000D - Right Left Wrong

We have a line of cells. Each cell contains a positive value a[i] and a character, either L or R. An operation chooses a pair of positions (l, r) with l < r, where position l currently contains L and position r currently contains R.

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000G - Call During the Journey

We are working on a weighted undirected graph where each edge has two travel modes. Walking is always available and slower, while a bus ride is faster but only usable outside a fixed time interval during the day.

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000B - Seating in a Bus

We have a bus with n seats in a single row, numbered from 1 to n. Passengers board one by one, and each chooses a seat according to a simple rule: the first passenger can sit anywhere, but any subsequent passenger must sit adjacent to an already occupied seat.

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000F - Color Rows and Columns

Each rectangle is a grid of $ai$ columns and $bi$ rows. We may color individual cells one by one. Whenever a row becomes completely colored, we gain one point. Whenever a column becomes completely colored, we also gain one point. The rectangles are independent.

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000E - Photoshoot for Gorillas

We are placing weighted objects onto a grid, but the score is not just the sum of values on the grid. Instead, every placement contributes multiple times: each cell participates in several overlapping fixed-size $k times k$ sub-squares, and the total score is the sum over all…

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000A - Primary Task

We are given a list of integers written on a board, and one of them might be a corrupted representation of a number of the form $10^x$ where $x ge 2$. The corruption happens because the exponentiation symbol '^' was lost.

Practice › Codeforces Solutions › Codeforces Round 966 (Div. 3) ›

CF 2000C - Numeric String Template

The problem asks us to check whether a string matches a numeric template. The template is an array of integers where the same number should correspond to the same letter in a string, and the same letter should correspond to the same number.