OMORI CONTEST

7 problems from OMORI CONTEST (contest 105430), difficulty -. 1/7 solutions verified against sample I/O.

7 items

OMORI CONTEST

Special | 7 problems | 1/7 verified | Difficulty - | 12m 12s

#	Problem	Rating	Tags	Accepted	Time	✓
A	SUNNY				2m 50s
B	AUBREY				2m 1s
C	HERO				1m 49s
D	KEL				1m 3s	✓
E	MARI				1m 40s
F	BASIL				1m 19s
G	OMORI				1m 30s

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430G - OMORI

We are given a set of $n$ hidden items, called dolls. Exactly one doll is special and behaves differently: whenever it is compared with any other doll, the result is always a tie.

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430F - BASIL

We are given an array of flower pots. Each pot has two attributes: a number of seeds and a type label. A move consists of choosing a pot that still contains seeds, removing any positive number of seeds from it, and then performing a global operation that depends on the type of…

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430E - MARI

We are given a starting value and then a sequence of ovens, each associated with a fixed number. When a cookie passes through an oven, that oven forces the current value either upward to at least the oven’s number or downward to at most the oven’s number.

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430D - KEL

We are given a large rectangle that is composed of four identical smaller rectangles. Each small rectangle has dimensions $L times W$, and they are arranged in a $2 times 2$ grid to form a big rectangle of size $2L times 2W$.

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430A - SUNNY

We are given two sorted sets of integers representing positions of vibrations on a huge number line. We are allowed to perform an operation where we pick a pivot position k, and every vibration strictly to the left of k moves one step further left, every vibration strictly to…

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430B - AUBREY

We are given a tree with values on nodes. For any choice of a root, every node induces a subtree, and inside that subtree we imagine choosing any subset of nodes. Each chosen node contributes its value via XOR, so each subset produces one XOR result.

Practice › Codeforces Solutions › OMORI CONTEST ›

CF 105430C - HERO

We are given an array of positive integers, and every contiguous subarray contributes a value based on two factors: the least common multiple of all elements in that subarray and the product of its endpoint indices.