Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2)

8 problems from Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) (contest 2096), difficulty 800-3200. 2/8 solutions verified against sample I/O.

8 items

Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2)

Div. 1+2 | 8 problems | 2/8 verified | Difficulty 800-3200 | 13m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Wonderful Sticks	800	constructive-algorithms, greedy	20,555	1m 32s
B	Wonderful Gloves	1100	greedy, math, sortings	16,564	1m 43s	✓
C	Wonderful City	1700	dp, implementation	8,224	1m 46s	✓
D	Wonderful Lightbulbs	2000	combinatorics, constructive-algorithms, math	5,597	1m 51s
E	Wonderful Teddy Bears	2400	greedy, implementation, sortings	2,046	1m 22s
F	Wonderful Impostors	3100	data-structures, implementation, two-pointers	458	1m 33s
G	Wonderful Guessing Game	3200	bitmasks, constructive-algorithms, interactive	421	1m 35s
H	Wonderful XOR Problem	3200	bitmasks, combinatorics, dp	223	1m 42s

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096H - Wonderful XOR Problem

We are given n intervals, each defined by a lower and upper bound [li, ri]. From each interval, we can pick a number ai within its bounds. Our goal is to consider all sequences (a1, a2, ...

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096G - Wonderful Guessing Game

We are asked to play an interactive guessing game with a student, Alice. She secretly selects a number between 1 and $n$. We do not know her number in advance. Our task is to determine her number by submitting a fixed sequence of queries and then analyzing the responses.

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096D - Wonderful Lightbulbs

We are given a final configuration of lit cells on an infinite integer grid. Initially, all cells are off except one hidden “origin” cell that was on at the beginning.

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096F - Wonderful Impostors

We are given a game with n viewers, each of whom may either be a crewmate or an impostor. The viewers make statements about themselves and others in contiguous ranges.

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096E - Wonderful Teddy Bears

We are given a row of teddy bears, each colored either black or pink. A sequence of teddy bears is considered beautiful if all black bears appear to the left of all pink bears. Our goal is to transform any given arrangement into a beautiful one using the fewest possible moves.

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096C - Wonderful City

We are given an $n times n$ grid where each cell contains an initial building height. We are allowed to modify the grid using two kinds of operations.

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096B - Wonderful Gloves

We are given a collection of gloves in a drawer, where each glove has a color and a type: left or right. For each of the $n$ colors, we know exactly how many left gloves $li$ and right gloves $ri$ exist.

Practice › Codeforces Solutions › Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ›

CF 2096A - Wonderful Sticks

We are given a permutation task over the numbers from 1 to n. Each number represents a stick length, and every length must be used exactly once. The goal is to arrange these sticks in a sequence so that the relative constraints between consecutive positions are satisfied.