Codeforces Round 190 (Div. 1)

Solutions for Codeforces Round 190 (Div. 1) (contest 321). 2/2 problems verified against sample I/O. Difficulty range: 2100-2600.

2 items

Codeforces Round 190 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 2/2 | Rating range: 2100-2600 | Time: 5m 17s

Problem Name Rating Tags Solve Time Verified
C Ciel the Commander 2100 constructive-algorithms, dfs-and-similar, divide-and-conquer 3m 39s ✓
E Ciel and Gondolas 2600 data-structures, divide-and-conquer, dp 1m 38s ✓
Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321C - Ciel the Commander

We are given a tree with n cities connected by n-1 roads. Each city must be assigned an officer with a rank from 'A' (highest) to 'Z' (lowest).
codeforces competitive-programming constructive-algorithms dfs-and-similar divide-and-conquer greedy trees May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 190 (Div. 1) ›

CF 321E - Ciel and Gondolas

We are given a sequence of people standing in a line, indexed from 1 to n. We must split this line into k consecutive groups.
codeforces competitive-programming data-structures divide-and-conquer dp May 29, 2026