Nebius Welcome Round (Div. 1 + Div. 2)

Solutions for Nebius Welcome Round (Div. 1 + Div. 2) (contest 1804). 5/6 problems verified against sample I/O. Difficulty range: 800-3500.

7 items

Nebius Welcome Round (Div. 1 + Div. 2)

Type: Div. 1+2 | Problems: 6 | Verified: 5/6 | Rating range: 800-3500 | Time: 13m 54s

Problem Name Rating Tags Solve Time Verified
A Lame King 800 greedy, math 3m 40s ✓
B Vaccination 1000 greedy, implementation 2m 25s ✓
C Pull Your Luck 1500 brute-force, greedy, math 1m 41s ✓
D Accommodation 2000 brute-force, dp, greedy 1m 43s ✓
F Approximate Diameter 2700 binary-search, divide-and-conquer, graphs 3m 5s ✗
G Flow Control 3500 data-structures, dsu, implementation 1m 20s ✓
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804F - Approximate Diameter

We are given a connected, undirected graph with up to 100,000 vertices and 100,000 edges. Each edge has a unit length. The graph may contain multiple edges between the same pair of vertices and self-loops.
codeforces competitive-programming binary-search divide-and-conquer graphs shortest-paths Jun 9, 2026
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804H - Code Lock

We are given a circular code lock with k sections, each labeled with a unique letter from the first k letters of the alphabet. Lara wants to enter a password of length n, consisting only of those k letters.
codeforces competitive-programming bitmasks dp Jun 9, 2026
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804G - Flow Control

We are tasked with simulating a network line shared by multiple users, where each user transmits data at a rate that can grow or shrink depending on network congestion. Each user has a start time, end time, and initial data rate.
codeforces competitive-programming data-structures dsu implementation Jun 9, 2026
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804A - Lame King

A king starts at the origin of a grid and wants to reach a target cell (a, b). Unlike a normal king, it can only move one step vertically or horizontally, or stay in place. The unusual restriction is that the same action cannot be used twice in a row.
codeforces competitive-programming greedy math Jun 9, 2026
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804D - Accommodation

We are given a grid of size $n times m$ where each cell represents a window in a high-rise building. Each cell is either lit or dark. The building is structured in floors, and each floor is an independent row of the grid.
codeforces competitive-programming brute-force dp greedy implementation Jun 9, 2026
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804B - Vaccination

We are given a sorted list of arrival times of patients. Each patient arrives at a specific moment and is willing to wait for a limited number of time units, meaning there is a window during which they can be vaccinated.
codeforces competitive-programming greedy implementation Jun 9, 2026
Practice › Codeforces Solutions › Nebius Welcome Round (Div. 1 + Div. 2) ›

CF 1804C - Pull Your Luck

We have a roulette wheel with n sectors numbered from 0 to n-1. The wheel starts with an arrow pointing at sector x, and we can spin it by pulling a handle with an integer force f between 1 and p.
codeforces competitive-programming brute-force greedy math number-theory Jun 9, 2026