TheForces Round #28 (Epic-Forces)

6 problems from TheForces Round #28 (Epic-Forces) (contest 105028), difficulty -. 0/6 solutions verified against sample I/O.

6 items

TheForces Round #28 (Epic-Forces)

Special | 6 problems | 0/6 verified | Difficulty - | 9m 3s

#	Problem	Time
A	Minimum Black Cells	1m 23s
B	Sequence Duplication	1m 19s
C	Perfect Square Matrix	1m 22s
D	Tree Merger	1m 51s
E	RBS Score	1m 47s
F	Too Many BSTs	1m 21s

Practice › Codeforces Solutions › TheForces Round #28 (Epic-Forces) ›

CF 105028D - Tree Merger

We are given a tree where every node carries an initial integer value. The only allowed operation is to pick an edge whose endpoints currently have the same value, merge those two endpoints into a single node, and assign that new node the sum of the two values.

Practice › Codeforces Solutions › TheForces Round #28 (Epic-Forces) ›

CF 105028E - RBS Score

We are given a bracket string that changes over time. After each update, we must compute how many substrings of the current string form a correct, fully balanced bracket sequence.

Practice › Codeforces Solutions › TheForces Round #28 (Epic-Forces) ›

CF 105028F - Too Many BSTs

We are given a fixed sequence of values that will always be inserted into a binary search tree in the same order, and then many queries, each introducing a different value that is inserted first before that fixed sequence.

Practice › Codeforces Solutions › TheForces Round #28 (Epic-Forces) ›

CF 105028A - Minimum Black Cells

We are working on an $n times n$ grid where movement is allowed in four directions, as long as we stay inside the grid. A traveler starts at the top-left cell and wants to reach the bottom-right cell.

Practice › Codeforces Solutions › TheForces Round #28 (Epic-Forces) ›

CF 105028C - Perfect Square Matrix

We are given an initially empty $n times n$ grid filled with zeros. We must choose exactly $n$ distinct cells and assign them the values $1, 2, ldots, n$, each used exactly once, leaving all other cells as zero. After placing these numbers, every square submatrix is examined.

Practice › Codeforces Solutions › TheForces Round #28 (Epic-Forces) ›

CF 105028B - Sequence Duplication

We are given two sequences. The first sequence a is the pattern we want to match, and the second sequence b is a base sequence that is repeated endlessly, but only a finite number of times. If we repeat b exactly k times, we get a long sequence made of k consecutive copies of b.