Codeforces Round 488 by NEAR (Div. 1)

5 problems from Codeforces Round 488 by NEAR (Div. 1) (contest 993), difficulty 1900-3200. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 488 by NEAR (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1900-3200 | 15m 27s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Open Communication	1900	bitmasks, brute-force	2,052	4m 46s	✓
C	Careful Maneuvering	2100	bitmasks, brute-force, geometry	1,808	2m 3s	✓
D	Compute Power	2500	binary-search, dp, greedy	835	1m 45s
E	Nikita and Order Statistics	2300	chinese-remainder-theorem, fft, math	1,785	1m 42s
F	The Moral Dilemma	3200		67	5m 11s	✓

Practice › Codeforces Solutions › Codeforces Round 488 by NEAR (Div. 1) ›

CF 993F - The Moral Dilemma

We are given a fixed logical circuit built in two layers above a set of binary input features. The first layer contains a small number of gates, each reading exactly two input variables and producing a boolean output using one of four operations: AND, OR, NAND, or NOR.

Practice › Codeforces Solutions › Codeforces Round 488 by NEAR (Div. 1) ›

CF 993E - Nikita and Order Statistics

We are given an array and a threshold value x. For every possible integer k from 0 to n, we need to count how many subarrays have exactly k elements strictly smaller than x.

Practice › Codeforces Solutions › Codeforces Round 488 by NEAR (Div. 1) ›

CF 993B - Open Communication

Two people each receive a secret pair of distinct digits from 1 to 9. The two hidden pairs are linked by a single property: they share exactly one common number. You are not given the hidden pairs directly.

Practice › Codeforces Solutions › Codeforces Round 488 by NEAR (Div. 1) ›

CF 993D - Compute Power

We are given a collection of tasks. Each task has a “power” value and a “processor requirement”. A machine can run at most two tasks, but there is a strict ordering rule if it runs two: the first task assigned to a machine is allowed to be arbitrary, while the second…

Practice › Codeforces Solutions › Codeforces Round 488 by NEAR (Div. 1) ›

CF 993C - Careful Maneuvering

We are given two sets of enemy ships, all lying on two vertical lines: one group is fixed at $x=-100$, the other at $x=100$. Each ship has an integer $y$-coordinate, and multiple ships may share the same $y$.