Codeforces Round 266 (Div. 2)

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

5 items

Codeforces Round 266 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 1200-2100 | Time: 7m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cheap Travel	1200	implementation	54s	✓
C	Number of Ways	1700	binary-search, brute-force, data-structures	1m 18s	✓
D	Increase Sequence	2100	combinatorics, dp	2m 35s	✓
E	Information Graph	2100	dfs-and-similar, dsu, graphs	2m 46s	✓

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

CF 466D - Increase Sequence

We are given an integer sequence and a target value h. The goal is to transform every element of the sequence into h by repeatedly performing a very specific type of operation.

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

We have a company hierarchy that is built gradually over time. Initially nobody has a boss. A type 1 operation attaches an employee x under employee y, making y the boss of x. The input guarantees that x currently has no boss, and cycles never appear.

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.

Codeforces Round 266 (Div. 2)

Codeforces Round 266 (Div. 2)

CF 466D - Increase Sequence

CF 466E - Information Graph

CF 466A - Cheap Travel

CF 466C - Number of Ways