RCC 2014 Warmup (Div. 1)

Solutions for RCC 2014 Warmup (Div. 1) (contest 418). 1/2 problems verified against sample I/O. Difficulty range: 2800-3100.

2 items

RCC 2014 Warmup (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 2800-3100 | Time: 3m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
D	Big Problems for Organizers	2800	data-structures, graphs, trees	1m 40s	✓
E	Tricky Password	3100	data-structures	1m 53s	✗

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 1) ›

CF 418D - Big Problems for Organizers

The task gives a tree of hotels, where every road connects two hotels and moving along a road costs one unit of time. For each query, two hotels are chosen as main event locations.

Practice › Codeforces Solutions › RCC 2014 Warmup (Div. 1) ›

CF 418E - Tricky Password

We are asked to simulate a dynamic table derived from an initial row of integers. Each subsequent row is generated such that the entry in column p of row i equals the count of how many times the value in column p of the previous row has appeared so far in that row.