TheForces Round #35 (LOL-Forces)

5 problems from TheForces Round #35 (LOL-Forces) (contest 105390), difficulty -. 0/5 solutions verified against sample I/O.

5 items

TheForces Round #35 (LOL-Forces)

Special | 5 problems | 0/5 verified | Difficulty - | 9m 47s

#	Problem	Time
A	Simple Update - I	1m 52s
B	Simple Update - II	2m 3s
D	String From Another World	2m 14s
E	Innocent Students	2m 4s
F	Red Blue Tree	1m 34s

Practice › Codeforces Solutions › TheForces Round #35 (LOL-Forces) ›

CF 105390E - Innocent Students

We are given an array of integers representing answers from students sitting in a line. Each query either changes one student’s answer or asks about a contiguous segment of students together with a hypothetical correct answer value x.

Practice › Codeforces Solutions › TheForces Round #35 (LOL-Forces) ›

CF 105390A - Simple Update - I

We are given a binary string, meaning each position is either 0 or 1, and we are allowed to repeatedly apply a very specific local transformation.

Practice › Codeforces Solutions › TheForces Round #35 (LOL-Forces) ›

CF 105390F - Red Blue Tree

We are given a tree where each node carries two independent pieces of information: a color, either red or blue, and a positive weight.

Practice › Codeforces Solutions › TheForces Round #35 (LOL-Forces) ›

CF 105390D - String From Another World

We are given a target string $s$ and a fixed number of seconds $m$. Starting from an empty string $t$, each second we apply exactly one operation.

Practice › Codeforces Solutions › TheForces Round #35 (LOL-Forces) ›

CF 105390B - Simple Update - II

We are given a binary string and a parameter $k$. For each value of $k$ from $1$ up to $lfloor n/2 rfloor$, we are allowed to repeatedly apply a transformation that acts on a window of length $2k$.