Codeforces Round 932 (Div. 2)

Solutions for Codeforces Round 932 (Div. 2) (contest 1935). 2/6 problems verified against sample I/O. Difficulty range: 800-2800.

6 items

Codeforces Round 932 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2800 | Time: 12m 8s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Entertainment in MAC	800	constructive-algorithms, strings	2m 1s	✗
B	Informatics in MAC	1200	constructive-algorithms	2m 11s	✗
C	Messenger in MAC	1800	binary-search, brute-force, constructive-algorithms	1m 29s	✓
D	Exam in MAC	1800	binary-search, combinatorics, implementation	2m 6s	✓
E	Distance Learning Courses in MAC	2400	bitmasks, brute-force, data-structures	2m 17s	✗
F	Andrey's Tree	2800	binary-search, constructive-algorithms, data-structures	2m 4s	✗

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

CF 1935E - Distance Learning Courses in MAC

We are given a sequence of courses, where each course does not have a fixed value but rather a range of possible grades. For course $i$, we are allowed to pick any integer $ci$ from $[xi, yi]$.

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

CF 1935F - Andrey's Tree

The problem asks us to simulate the removal of each vertex from a given tree and then determine the minimal cost required to reconnect the remaining vertices into a tree. The tree is represented as a standard undirected graph without cycles.

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

CF 1935D - Exam in MAC

We are given a fixed set of forbidden integers and a large interval of possible values for two variables $x$ and $y$, where $0 le x le y le c$.

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

CF 1935B - Informatics in MAC

We are given an array of integers ranging from 0 to $n-1$, and we need to divide it into at least two contiguous subsegments such that every subsegment has the same MEX. The MEX of a subarray is the smallest non-negative integer missing from that subarray.

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

CF 1935A - Entertainment in MAC

We are given a string s and an even number n, representing the total number of operations we must apply. There are two types of operations available: we can either reverse the current string, or append its reverse to itself.

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

CF 1935C - Messenger in MAC

We are given a set of messages, each with two characteristics: ai, the base reading time for the message, and bi, a coordinate that influences transition cost between consecutive messages.