Codeforces Round 533 (Div. 2)

5 problems from Codeforces Round 533 (Div. 2) (contest 1105), difficulty 1100-2200. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 533 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1100-2200 | 18m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Salem and Sticks	1100	brute-force, implementation	11,550	3m 55s	✓
B	Zuhair and Strings	1100	brute-force, implementation, strings	10,555	7m 18s	✓
C	Ayoub and Lost Array	1500	combinatorics, dp, math	11,365	1m 25s	✓
D	Kilani and the Game	1900	dfs-and-similar, graphs, implementation	4,423	5m 10s	✓
E	Helping Hiasat	2200	bitmasks, brute-force, dp	1,914	1m 9s	✓

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

CF 1105E - Helping Hiasat

We are given a timeline of events. At any moment, Hiasat’s profile has a single visible handle, and he is allowed to change this handle only at specific moments marked in the input. Between changes, the handle stays fixed.

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

CF 1105A - Salem and Sticks

We are given a list of stick lengths, and we are allowed to replace each length with any other positive integer. Changing a stick from its original length to a new length costs exactly the absolute difference between the two values.

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

CF 1105B - Zuhair and Strings

We are given a string and a fixed window size $k$. The task is to repeatedly carve out several disjoint blocks of length $k$ from the string. Each chosen block must consist of the same character repeated $k$ times, and all chosen blocks must use the same character.

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

CF 1105D - Kilani and the Game

We are given a rectangular grid where each cell is either blocked, empty, or already owned by one of up to nine players.

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

CF 1105C - Ayoub and Lost Array

We are asked to count how many arrays of length $n$ can be formed such that every element lies within a fixed interval $[l, r]$, and the total sum of all elements is divisible by 3.