Codeforces Round 190 (Div. 1)

5 problems from Codeforces Round 190 (Div. 1) (contest 321), difficulty 1700-2900. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 190 (Div. 1)

Div. 1 | 5 problems | 5/5 verified | Difficulty 1700-2900 | 6m 10s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Ciel and Robot	1700	binary-search, implementation, math	3,901	1m 8s	✓
B	Ciel and Duel	1900	dp, flows, greedy	3,835	1m 19s	✓
C	Ciel the Commander	2100	constructive-algorithms, dfs-and-similar, divide-and-conquer	9,384	1m 6s	✓
D	Ciel and Flipboard	2900	dp, greedy, math	594	1m 27s	✓
E	Ciel and Gondolas	2600	data-structures, divide-and-conquer, dp	6,269	1m 10s	✓

Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321B - Ciel and Duel

We are given two sets of cards, one belonging to Jiro and one belonging to Ciel. Jiro’s cards come in two types, Attack and Defense, each with a strength value. Ciel’s cards are simpler: every one of her cards is an Attack card with a given strength.

Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321C - Ciel the Commander

We are given a tree with up to 100,000 nodes, and we must assign each node a letter from 'A' to 'Z'. These letters represent ranks, where 'A' is the strongest and 'Z' is the weakest.

Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321E - Ciel and Gondolas

We are given a line of people from position 1 to position n, and we must split this line into exactly k contiguous groups. Each group corresponds to a gondola ride and contains consecutive people in the queue.

Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321D - Ciel and Flipboard

We have a square board of size n by n, where n is always an odd number. Each cell contains an integer, which may be positive or negative.

Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321A - Ciel and Robot

We are asked to determine whether a robot moving on a 2D plane can reach a target point (a, b). The robot starts at the origin (0, 0) and follows a sequence of moves encoded in a string.