Codeforces Round 914 (Div. 2)

Solutions for Codeforces Round 914 (Div. 2) (contest 1904). 2/7 problems verified against sample I/O. Difficulty range: 900-2800.

7 items

Codeforces Round 914 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 2/7 | Rating range: 900-2800 | Time: 15m 49s

Problem Name Rating Tags Solve Time Verified
A Forked! 900 brute-force, implementation 2m 15s ✓
B Collecting Game 1100 binary-search, dp, greedy 2m 22s ✗
C Array Game 1400 binary-search, brute-force, data-structures 2m 5s ✗
D1 Set To Max (Easy Version) 1600 brute-force, constructive-algorithms, greedy 2m 49s ✗
D2 Set To Max (Hard Version) 1800 constructive-algorithms, data-structures, divide-and-conquer 2m 31s ✗
E Tree Queries 2500 data-structures, dfs-and-similar, graphs 1m 7s ✓
F Beautiful Tree 2800 data-structures, dfs-and-similar, graphs 2m 40s ✗
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904F - Beautiful Tree

We are given a tree with $n$ nodes. Each node must be assigned a distinct integer from $1$ to $n$, so we are effectively building a permutation over the vertices. The constraint is not arbitrary: it must respect a collection of path-based extremum rules.
codeforces competitive-programming data-structures dfs-and-similar graphs implementation trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904D1 - Set To Max (Easy Version)

We are given two arrays, a and b, each containing n integers. The goal is to transform a into b by repeatedly choosing a contiguous subarray of a and setting all its elements to the maximum element of that subarray.
codeforces competitive-programming brute-force constructive-algorithms greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904D2 - Set To Max (Hard Version)

We are given two arrays, a and b, of length n. Our goal is to transform a into b using an operation that allows us to select any contiguous subarray and replace all its values with the maximum value of that subarray.
codeforces competitive-programming constructive-algorithms data-structures divide-and-conquer greedy implementation sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904E - Tree Queries

We are given a tree with $n$ nodes and need to answer $q$ queries. Each query specifies a starting node $x$ and a set of nodes to remove. After removing the specified nodes and all incident edges, we must find the length of the longest simple path starting at $x$.
codeforces competitive-programming data-structures dfs-and-similar graphs implementation trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904B - Collecting Game

We are asked to simulate a collection game with an array of positive integers. You start with a “score” equal to a selected array element and then attempt to remove other elements one by one.
codeforces competitive-programming binary-search dp greedy sortings two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904A - Forked!

The problem asks us to find all positions on an infinite chessboard where a modified knight can attack both a given king and a queen.
codeforces competitive-programming brute-force implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 914 (Div. 2) ›

CF 1904C - Array Game

We are given an array of positive integers. We repeatedly perform an operation where we pick two existing positions and append the absolute difference of those two values to the end of the array.
codeforces competitive-programming binary-search brute-force data-structures sortings two-pointers Jun 8, 2026