Codeforces Round 266 (Div. 2)

Solutions for Codeforces Round 266 (Div. 2) (contest 466). 3/5 problems verified against sample I/O. Difficulty range: 1200-2100.

4 items

Codeforces Round 266 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1200-2100 | Time: 6m 29s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cheap Travel	1200	implementation	54s	✓
B	Wonder Room	2000	brute-force, math	1m 22s	✓
C	Number of Ways	1700	binary-search, brute-force, data-structures	1m 18s	✓
D	Increase Sequence	2100	combinatorics, dp	1m 14s	✗
E	Information Graph	2100	dfs-and-similar, dsu, graphs	1m 41s	✗

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

CF 466A - Cheap Travel

Ann needs to commute using the subway a total of n times. She can pay for each ride individually at a cost of a rubles, or she can buy a special multi-ride ticket that covers exactly m rides and costs b rubles.

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

CF 466C - Number of Ways

We are given a sequence of integers arranged in a line, and we want to split it into three contiguous segments. The cut points must produce three non-empty parts, and each part must have exactly the same sum.

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

CF 466D - Increase Sequence

We are given an integer array and a target height. The goal is to transform every element of the array into the same final value using a sequence of operations. Each operation picks a segment of indices and increases every value in that segment by exactly one.

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

CF 466E - Information Graph

We are dealing with a dynamic company hierarchy problem. We have n employees, initially without any reporting structure.