Codeforces Round 974 (Div. 3)

Solutions for Codeforces Round 974 (Div. 3) (contest 2014). 5/8 problems verified against sample I/O. Difficulty range: 800-2200.

8 items

Codeforces Round 974 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 5/8 | Rating range: 800-2200 | Time: 13m 2s

Problem Name Rating Tags Solve Time Verified
A Robin Helps 800 greedy, implementation 1m 11s ✗
B Robin Hood and the Major Oak 800 math 54s ✓
C Robin Hood in Town 1100 binary-search, greedy, math 1m 54s ✗
D Robert Hood and Mrs Hood 1400 brute-force, data-structures, greedy 2m 1s ✓
E Rendez-vous de Marian et Robin 1800 dfs-and-similar, graphs, shortest-paths 1m 14s ✓
F Sheriff's Defense 2000 dfs-and-similar, dp, greedy 1m 47s ✗
G Milky Days 2200 brute-force, data-structures, greedy 1m 59s ✓
H Robin Hood Archery 1900 data-structures, divide-and-conquer, greedy 2m 2s ✓
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014H - Robin Hood Archery

For each query we look only at the subarray $al, a{l+1}, dots, ar$. Robin moves first. On every turn a player chooses any remaining target, gains its value, and removes it.
codeforces competitive-programming data-structures divide-and-conquer greedy hashing Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014G - Milky Days

We are tracking Little John's milk consumption over time. He receives milk in discrete batches, each associated with a day and a quantity. Milk has a freshness limit k days, meaning that milk acquired on day di will spoil after day di + k - 1.
codeforces competitive-programming brute-force data-structures greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014F - Sheriff's Defense

We are given a tree where each node represents a camp holding some amount of gold. We may choose certain camps to “strengthen”. Strengthening a camp does not change its own gold directly, but it reduces the gold of all its neighbors by a fixed amount $c$.
codeforces competitive-programming dfs-and-similar dp greedy trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014D - Robert Hood and Mrs Hood

Each job occupies an interval of days [l, r]. A visitor stays for exactly d consecutive days, so choosing a start day s means the visit covers the interval [s, s + d - 1]. A job is counted if it overlaps the visit at least once. The amount of overlap does not matter.
codeforces competitive-programming brute-force data-structures greedy sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014E - Rendez-vous de Marian et Robin

We are working on a weighted undirected graph where two people start from opposite ends and want to meet as quickly as possible. One starts at vertex 1 and the other at vertex n.
codeforces competitive-programming dfs-and-similar graphs shortest-paths Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014C - Robin Hood in Town

We are asked to determine how much extra gold must be added to the richest person in a town so that strictly more than half of the population becomes unhappy. Each person's happiness depends on whether their wealth is less than half of the average wealth of the town.
codeforces competitive-programming binary-search greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014A - Robin Helps

This is a construction and impossibility problem (type D/B hybrid). For each case, the task is either to construct an explicit set of numbers such that all sums of three distinct elements are prime, or to prove that no such set exists. Each of the four subcases is independent.
codeforces competitive-programming greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 974 (Div. 3) ›

CF 2014B - Robin Hood and the Major Oak

The tree produces new leaves every year. In year $i$, it grows $i^i$ leaves. Leaves do not stay forever. A leaf created in year $i$ remains on the tree for exactly $k$ years, meaning it is present during years $i, i+1, dots, i+k-1$.
codeforces competitive-programming math Jun 8, 2026