Codeforces Round 145 (Div. 2, ACM-ICPC Rules)

8 problems from Codeforces Round 145 (Div. 2, ACM-ICPC Rules) (contest 234), difficulty 1000-2000. 6/8 solutions verified against sample I/O.

8 items

Codeforces Round 145 (Div. 2, ACM-ICPC Rules)

Div. 2 | 8 problems | 6/8 verified | Difficulty 1000-2000 | 16m 2s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Lefthanders and Righthanders	1200	implementation	4,674	2m	✓
B	Reading	1000	sortings	7,695	1m 44s	✓
C	Weather	1300	dp, implementation	5,946	1m 31s	✓
D	Cinema	1600	implementation	1,603	2m 18s	✓
E	Champions' League	1600	implementation	1,050	2m 25s
F	Fence	1800	dp	1,970	2m 27s	✓
G	Practice	1600	constructive-algorithms, divide-and-conquer, implementation	1,582	1m 38s	✓
H	Merging Two Decks	2000	constructive-algorithms, greedy	619	1m 59s

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234B - Reading

We are asked to help Vasya pick the best hours to read a textbook on a train ride. The train trip lasts for n hours, and each hour has a given light level between 0 and 100. Vasya wants to read for exactly k hours.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234C - Weather

We are given a sequence of daily temperatures. We may change any temperature to any other value, and each modified position costs one change. The goal is to make the sequence follow a very specific pattern.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234H - Merging Two Decks

We are given two decks of cards, each with a specific order from top to bottom, and each card is either face up or face down. The first deck has n cards, the second deck has m cards.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234G - Practice

We have n football players, numbered from 1 to n. Each practice consists of splitting all players into two non-empty teams.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234F - Fence

We are given a fence made of n vertical boards, each with a specified height. Vasya has two paint colors, red and green, each with a limited total area he can paint. Every board must be painted exactly one color, and the total painted area of each color cannot exceed its limit.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234E - Champions' League

We are asked to simulate a simplified version of the UEFA Champions League group stage draw. There are n teams, with n divisible by four, each assigned a unique rating. The goal is to divide the teams into groups of four, following a structured "basket" draw procedure.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234D - Cinema

Vasya has a list of movies and a list of favorite actors. Each movie lists some of its cast, but some actor IDs may be missing (represented by 0).

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234A - Lefthanders and Righthanders

We are asked to seat an even number of students, each either left-handed or right-handed, at desks that hold exactly two students. Each desk has a left and a right position.