Codeforces Round 169 (Div. 2)

5 problems from Codeforces Round 169 (Div. 2) (contest 276), difficulty 900-2100. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 169 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 900-2100 | 6m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Lunch Rush	900	implementation	30,060	1m 19s	✓
B	Little Girl and Game	1300	games, greedy	32,102	1m 39s	✓
C	Little Girl and Maximum Sum	1500	data-structures, greedy, implementation	39,517	1m 4s	✓
D	Little Girl and Maximum XOR	1700	bitmasks, dp, greedy	16,362	58s	✓
E	Little Girl and Problem on Trees	2100	data-structures, graphs, trees	1,859	1m 47s

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

CF 276C - Little Girl and Maximum Sum

We are given an array of numbers and a set of interval queries over positions in that array. Each query asks for the sum of elements in a contiguous segment. Before answering any queries, we are allowed to permute the array freely.

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

CF 276B - Little Girl and Game

We are given a string of lowercase letters and two players who take turns removing a single character. A player wins immediately before their turn if the current letters can be rearranged into a palindrome.

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

CF 276E - Little Girl and Problem on Trees

We are given a tree where almost every node behaves like a point on a thin structure. Every node except node 1 has degree at most 2, which means the tree is essentially a collection of simple chains attached to a single branching root.

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

CF 276D - Little Girl and Maximum XOR

We are asked to find the maximum XOR value of two integers within a given inclusive range $[l, r]$. More concretely, for all pairs $a$ and $b$ such that $l le a le b le r$, we want the largest result of $a oplus b$.

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

CF 276A - Lunch Rush

We are given a list of restaurants, where each restaurant has two values: a baseline enjoyment score and the time required to eat there. The coach only allows a fixed lunch duration.