Codeforces Round 585 (Div. 2)

Solutions for Codeforces Round 585 (Div. 2) (contest 1215). 4/6 problems verified against sample I/O. Difficulty range: 1000-2700.

6 items

Codeforces Round 585 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 1000-2700 | Time: 19m 34s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Yellow Cards	1000	greedy, implementation, math	1m 33s	✓
B	The Number of Products	1400	combinatorics, dp, implementation	3m 38s	✓
C	Swap Letters	1500	constructive-algorithms, greedy	1m 42s	✓
D	Ticket Game	1700	games, greedy, math	8m	✗
E	Marbles	2200	bitmasks, dp	2m 26s	✓
F	Radio Stations	2700	2-sat	2m 15s	✗

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

CF 1215D - Ticket Game

We are given a ticket represented by a string of even length. Each position corresponds to a digit from 0 to 9, except that some positions are unknown and marked with a question mark. The unknown positions must eventually be filled with digits.

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

CF 1215B - The Number of Products

We are given a sequence of nonzero integers and asked to count how many subarrays produce a positive product and how many produce a negative product. A subarray is defined by choosing two indices $l le r$ and multiplying everything from $al$ to $ar$.

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

CF 1215E - Marbles

We are given a long row of marbles, each painted with one of at most 20 colors. The only allowed move is swapping two adjacent marbles, and we want to use as few swaps as possible. The goal is not to sort the marbles in the usual sense.

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

CF 1215F - Radio Stations

We are asked to assign a signal power to a set of radio stations and choose a subset of these stations such that all citizen complaints are satisfied, no two stations interfere, and each chosen station's signal power falls within its allowed range.

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

CF 1215C - Swap Letters

We are given two strings, s and t, of equal length composed only of the letters "a" and "b". The task is to make s and t identical using a sequence of allowed swap operations. Each operation lets us pick one character from s and one from t and swap them.

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

CF 1215A - Yellow Cards

In this problem, we have two football teams playing a match. Each team starts with a certain number of players, denoted by a1 and a2. Throughout the match, the referee shows n yellow cards to players.