Codeforces Round 245 (Div. 1)

5 problems from Codeforces Round 245 (Div. 1) (contest 429), difficulty 1300-3000. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 245 (Div. 1)

Div. 1 | 5 problems | 5/5 verified | Difficulty 1300-3000 | 6m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Xor-tree	1300	dfs-and-similar, trees	12,265	1m 38s	✓
B	Working out	1600	dp	10,211	57s	✓
C	Guess the Tree	2300	bitmasks, constructive-algorithms, dp	1,030	1m 26s	✓
D	Tricky Function	2200	data-structures, divide-and-conquer, geometry	3,231	1m 9s	✓
E	Points and Segments	3000	graphs	978	1m 37s	✓

Practice › Codeforces Solutions › Codeforces Round 245 (Div. 1) ›

CF 429A - Xor-tree

We are given a rooted tree with n nodes, each node labeled with a 0 or 1. We are also given a target configuration of 0s and 1s for each node. The only operation allowed is to "pick" a node, which flips its value and every second-level descendant down the tree.

Practice › Codeforces Solutions › Codeforces Round 245 (Div. 1) ›

CF 429B - Working out

We have a two-dimensional gym represented as a grid of size n × m. Each cell contains a positive integer representing the calories burned by doing the workout at that location.

Practice › Codeforces Solutions › Codeforces Round 245 (Div. 1) ›

CF 429C - Guess the Tree

The problem asks us to reconstruct a rooted tree given constraints on the sizes of the subtrees for each node. You are given an array c of length n, where c[i] represents the total number of nodes in the subtree rooted at node i.

Practice › Codeforces Solutions › Codeforces Round 245 (Div. 1) ›

CF 429D - Tricky Function

We are given an array of integers a with n elements. The task is to select two distinct indices i and j and compute a function f(i, j) that combines both the squared distance between the indices and the squared sum of the elements strictly between them.

Practice › Codeforces Solutions › Codeforces Round 245 (Div. 1) ›

CF 429E - Points and Segments

We are given a collection of segments on a number line. Each segment spans from a left endpoint to a right endpoint, and we must assign each segment one of two colors.