Codeforces Round 140 (Div. 1)

Solutions for Codeforces Round 140 (Div. 1) (contest 226). 4/5 problems verified against sample I/O. Difficulty range: 1400-2900.

5 items

Codeforces Round 140 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1400-2900 | Time: 14m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Flying Saucer Segments	1400	math	5m 43s	✓
B	Naughty Stone Piles	1900	greedy	2m 22s	✓
C	Anniversary	2400	data-structures, implementation, math	2m 19s	✓
D	The table	2100	constructive-algorithms, greedy	2m 58s	✗
E	Noble Knight's Path	2900	data-structures, trees	1m 11s	✓

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

CF 226A - Flying Saucer Segments

We are asked to calculate the minimum time required for a group of n aliens to move from the third section of a three-section spacecraft to the first section.

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

CF 226B - Naughty Stone Piles

We have several stone piles, each with some initial size. One operation chooses a source pile and merges it into another pile. The source pile disappears, the destination pile grows, and the operation cost equals the current size of the source pile.

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

CF 226C - Anniversary

We are asked to work with a contiguous range of integers from l to r, and for every possible subset of size k within this range, we consider the Fibonacci numbers at positions given by the subset elements.

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

CF 226D - The table

We are given a rectangular table of integers with $n$ rows and $m$ columns. Each cell contains a number that could be positive, negative, or zero. Harry can perform two types of operations: flip the sign of all numbers in a row or flip the sign of all numbers in a column.

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

CF 226E - Noble Knight's Path

In this problem, we are asked to simulate a sequence of events in a feudal hierarchy represented as a tree. Each feudal owns a castle, and except for the king, each feudal reports to exactly one superior.