Codeforces Round 241 (Div. 2)

Solutions for Codeforces Round 241 (Div. 2) (contest 416). 4/5 problems verified against sample I/O. Difficulty range: 1300-2500.

5 items

Codeforces Round 241 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1300-2500 | Time: 8m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Guess a number!	1400	greedy, implementation, two-pointers	1m 47s	✗
B	Art Union	1300	brute-force, dp, implementation	1m 26s	✓
C	Booking System	1600	binary-search, dp, greedy	1m 32s	✓
D	Population Size	2400	greedy, implementation, math	1m 23s	✓
E	President's Path	2500	dp, graphs, shortest-paths	2m 4s	✓

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

CF 416A - Guess a number!

We are given a sequence of statements about an unknown integer value $y$. Each statement restricts $y$ relative to some integer threshold $x$, and is either strict or non-strict. After each statement, we are also told whether that statement is true or false.

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

CF 416B - Art Union

We are given a production line where multiple paintings move through a fixed sequence of painters. Every painting must pass through all painters in order, from the first to the last.

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

CF 416C - Booking System

We are given a collection of booking requests, where each request represents a group of guests who either all get seated together or do not come at all.

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

CF 416D - Population Size

We are given a sequence of length $n$, where each position is either a fixed positive integer or unknown (marked as $-1$). The task is to interpret this sequence as being formed by concatenating several arithmetic progressions, one after another.

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

CF 416E - President's Path

We are given a graph with n cities connected by m bidirectional roads, each with a positive length. The goal is to determine, for every pair of cities (s, t) with s < t, how many roads can appear on at least one shortest path from s to t.