Codeforces Round 267 (Div. 2)

Solutions for Codeforces Round 267 (Div. 2) (contest 467). 3/5 problems verified against sample I/O. Difficulty range: 800-2400.

5 items

Codeforces Round 267 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-2400 | Time: 6m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	George and Accommodation	800	implementation	1m 1s	✓
B	Fedor and New Game	1100	bitmasks, brute-force, constructive-algorithms	1m 19s	✓
C	George and Job	1700	dp, implementation	1m 35s	✗
D	Fedor and Essay	2400	dfs-and-similar, dp, graphs	1m 26s	✗
E	Alex and Complicated Task	2300	data-structures, dp, greedy	1m 10s	✓

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

CF 467A - George and Accommodation

The problem presents a simple scenario: George and Alex want to find a dormitory room together. Each room in the dormitory has a current occupancy and a maximum capacity.

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

CF 467B - Fedor and New Game

We are given a game with several players, each controlling an army composed of different types of soldiers. Each army is represented as a non-negative integer where the binary representation encodes the presence of soldier types: a bit set to 1 means the army includes that type.

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

CF 467C - George and Job

George wants to maximize his earnings by choosing segments of work from a list of tasks, each with a given profit. The tasks are arranged sequentially in an array p of length n. He must select exactly k non-overlapping segments, each of length m.

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

CF 467D - Fedor and Essay

We are given an essay, which is a sequence of words, and a dictionary of synonym pairs. Each synonym pair allows us to replace one word with another, but only in the direction specified. Fedor wants to modify his essay to minimize the number of letters R (case-insensitive).

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

CF 467E - Alex and Complicated Task

We are given a long sequence of integers, and we are allowed to pick a subsequence from it. The goal is not just to maximize the length of the subsequence, but to impose a very specific structural constraint on how the chosen elements repeat.