Codeforces Beta Round 75 (Div. 1 Only)

Solutions for Codeforces Beta Round 75 (Div. 1 Only) (contest 91). 5/5 problems verified against sample I/O. Difficulty range: 1500-2600.

5 items

Codeforces Beta Round 75 (Div. 1 Only)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1500-2600 | Time: 12m 45s

Problem Name Rating Tags Solve Time Verified
A Newspaper Headline 1500 greedy, strings 1m 57s ✓
B Queue 1500 binary-search, data-structures 2m 10s ✓
C Ski Base 2300 combinatorics, dsu, graphs 3m 29s ✓
D Grocer's Problem 2600 constructive-algorithms, graphs, greedy 2m 25s ✓
E Igloo Skyscraper 2500 data-structures, geometry 2m 44s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 1 Only) ›

CF 91A - Newspaper Headline

We have a source string s1, which represents the headline of one newspaper. We may take as many copies of this headline as we want and concatenate them together.
codeforces competitive-programming greedy strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 1 Only) ›

CF 91B - Queue

We are given a queue of walruses, where index order goes from the tail toward the head. For every walrus at position i, we want to find the furthest position j i such that the walrus ahead is strictly younger, meaning a[j] < a[i]. If no such walrus exists, the answer is -1.
codeforces competitive-programming binary-search data-structures May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 1 Only) ›

CF 91C - Ski Base

We are asked to count the number of valid ski bases after each road is added to an initially empty graph. The graph consists of junctions as vertices and roads as edges.
codeforces competitive-programming combinatorics dsu graphs May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 1 Only) ›

CF 91D - Grocer's Problem

We are given a permutation of jars. Jar i should finally stand at position i, but the current arrangement is shuffled. One operation allows us to choose any subset of at most five positions and permute the jars inside those positions arbitrarily.
codeforces competitive-programming constructive-algorithms graphs greedy May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 1 Only) ›

CF 91E - Igloo Skyscraper

Each walrus builds a skyscraper whose height changes linearly over time. Walrus i starts with height a[i] and gains b[i] floors every minute, so at time t its height equals: $$hi(t) = ai + bi cdot t$$ For every query [l, r, t], we must find an index inside that interval whose…
codeforces competitive-programming data-structures geometry May 28, 2026