Codeforces Round 1008 (Div. 2)

Solutions for Codeforces Round 1008 (Div. 2) (contest 2078). 3/7 problems verified against sample I/O. Difficulty range: 800-2700.

7 items

Codeforces Round 1008 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 800-2700 | Time: 11m 26s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Final Verdict	800	math	1m 33s	✓
B	Vicious Labyrinth	1100	constructive-algorithms, graphs, greedy	1m 16s	✓
C	Breach of Faith	1500	constructive-algorithms, greedy, math	1m 27s	✗
D	Scammy Game Ad	1800	dp, greedy, implementation	2m 33s	✓
E	Finding OR Sum	1900	bitmasks, implementation, interactive	1m 29s	✗
F	Binary Subsequence Value Sum	2300	combinatorics, data-structures, dp	1m 43s	✗
G	Another Folding Strip	2700	combinatorics, data-structures, divide-and-conquer	1m 25s	✗

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

CF 2078G - Another Folding Strip

We are given an array of integers representing darkness levels for a strip of paper, and we have a peculiar operation: we can fold the strip any number of times, drop black dye at one position, and then unfold.

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

CF 2078F - Binary Subsequence Value Sum

We are working with a binary string that changes over time through flip operations. After every flip, we consider all non-empty subsequences of the current string. Each subsequence is assigned a score based on how it can be split into two parts.

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

CF 2078E - Finding OR Sum

We are given two hidden non-negative integers, x and y, each less than $2^{30}$. Our goal is to determine the sum of bitwise ORs $(m mid x) + (m mid y)$ for a given integer m.

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

CF 2078D - Scammy Game Ad

We have two lanes. Each lane starts with exactly one person. The level consists of n rounds. In each round there is a left gate and a right gate. A gate either adds a fixed number of people or multiplies the number of people currently in its lane.

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

CF 2078C - Breach of Faith

We are given a sequence of integers of length 2n+1 that satisfies a special alternating sum property: the first element equals the sum of the remaining elements taken with alternating signs, specifically a1 = a2 - a3 + a4 - a5 + ... + a2n - a2n+1.

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

CF 2078B - Vicious Labyrinth

We are given a labyrinth with $n$ cells arranged linearly, where cell $i$ is $n-i$ kilometers away from the exit at cell $n$. Each cell initially contains one person.

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

CF 2078A - Final Verdict

We are given an array of integers and a target value. The goal is to repeatedly split the array into equally-sized parts, replace the array with the averages of those parts, and continue until the array has only one element.