Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2)

9 problems from Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) (contest 2152), difficulty 800-3500. 1/9 solutions verified against sample I/O.

9 items

Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2)

Div. 1+2 | 9 problems | 1/9 verified | Difficulty 800-3500 | 25m 17s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Increase or Smash	800	greedy, implementation	22,297	5m 19s
B	Catching the Krug	1300	games	12,846	3m 8s
C	Triple Removal	1400	data-structures, greedy, math	12,208	2m 7s
D	Division Versus Addition	1700	games, greedy, math	6,743	1m 25s
E	Monotone Subsequence	2100	constructive-algorithms, graphs, greedy	2,777	1m 34s
F	Triple Attack	2500	data-structures, greedy	1,034	3m 22s	✓
G	Query Jungle	2900	data-structures, implementation, math	712	1m 54s
H1	Victorious Coloring (Easy Version)	2900	dfs-and-similar, dp, greedy	610	5m 6s
H2	Victorious Coloring (Hard Version)	3500	data-structures, greedy, schedules	199	1m 22s

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152H1 - Victorious Coloring (Easy Version)

We are given a tree with n vertices, each edge has a positive weight. The task is to assign nonnegative integer weights to the vertices themselves so that when we compute the minimum cost of a “victorious coloring” (coloring vertices red or yellow with at least one red)…

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152H2 - Victorious Coloring (Hard Version)

We are given a tree with weighted edges, and we are asked to assign nonnegative weights to vertices so that a certain “victorious coloring” has a minimum cost at least some value l, while keeping the sum of vertex weights as small as possible.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152F - Triple Attack

We are given a sorted sequence of attack timestamps. Each query gives a contiguous segment of this sequence, and inside that segment we are allowed to delete some elements. The goal is to keep as many timestamps as possible while avoiding a specific failure condition.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152G - Query Jungle

We are given a rooted tree with root fixed at vertex 1. Some vertices are marked as “active” (contain a monster), others are not.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152A - Increase or Smash

We are given an array of zeros of length $n$, and a target array of positive integers. We want to reach the target array with as few operations as possible. There are two operations available. The first, Increase, adds the same positive integer to every element of the array.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152E - Monotone Subsequence

We are given a hidden permutation of length $n^2 + 1$ and we need to find a monotone subsequence of length exactly $n+1$. The subsequence can either be increasing or decreasing.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152D - Division Versus Addition

We are given an array where every element starts at least 2, and two players repeatedly modify it until every value becomes 1.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152B - Catching the Krug

We are asked to compute the maximum number of turns the Krug can survive against Doran on a square grid. The grid has coordinates from 0 to n in both rows and columns. The Krug moves first, either staying in place or moving to a vertically or horizontally adjacent cell.

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152C - Triple Removal

We are given a binary array, meaning each element is either 0 or 1, and we need to repeatedly remove triples of identical elements. Each removal has a cost defined as the minimum distance between consecutive elements in the triple.