Codeforces Round 151 (Div. 2)

Solutions for Codeforces Round 151 (Div. 2) (contest 246). 3/3 problems verified against sample I/O. Difficulty range: 900-1600.

5 items

Codeforces Round 151 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 900-1600 | Time: 4m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Buggy Sorting	900	constructive-algorithms, greedy, sortings	1m 8s	✓
C	Beauty Pageant	1600	brute-force, constructive-algorithms, greedy	1m 43s	✓
D	Colorful Graph	1600	brute-force, dfs-and-similar, graphs	1m 30s	✓

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

CF 246A - Buggy Sorting

We are given only a single integer $n$, and we must construct an array of length $n$ that either breaks a very specific sorting procedure or prove that no such array exists.

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

CF 246B - Increase and Decrease

We have an array of integers, and we are allowed to pick two different elements and simultaneously increase one by 1 and decrease the other by 1. We can perform this operation as many times as we like.

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

CF 246C - Beauty Pageant

We are asked to select soldiers from a battalion to participate in a beauty pageant over several days. Each soldier has a unique beauty value. On each day, we must send a group of soldiers whose combined beauty is unique compared to the other days.

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

CF 246D - Colorful Graph

We are given an undirected graph where each vertex has a color, represented by an integer. The goal is to determine which color has the most diverse set of neighboring colors.

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

CF 246E - Blood Cousins Return

We are given a rooted forest describing family relations. Every person has a name and at most one parent. Multiple roots are allowed because some people may have no ancestor at all.