Winter Cup 6.0 Online Mirror Contest

13 problems from Winter Cup 6.0 Online Mirror Contest (contest 105010), difficulty -. 2/13 solutions verified against sample I/O.

13 items

Winter Cup 6.0 Online Mirror Contest

Special | 13 problems | 2/13 verified | Difficulty - | 17m 18s

#	Problem	Time	✓
A	Maximal String	1m 22s
B	Balanced Tournament	1m 23s
C	Cryptocurrency	1m 19s
D	Divisibility Game	1m 22s
E	Enemies of the heir... beware	1m 19s
F	Find The Tree ?	1m 21s
G	Grid Crash	1m 28s	✓
H	Hide the Money	1m 39s
I	Inclusion and Diversity	1m 1s	✓
J	New Language	27s
K	Unique Disk Identifier	1m 32s
M	Modular Universe	1m 25s
N	Infinite Money Glitch II	1m 40s

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010N - Infinite Money Glitch II

We are given a directed graph where each vertex represents a currency and each edge represents an exchange operation. If we go from currency u to currency v, the amount does not simply get multiplied by a rate, it also loses a fixed fee before conversion.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010M - Modular Universe

Each query describes a modular grid universe of size $n times m$, where positions wrap in a structured way. At any fixed time, there are $nm$ individuals, each indexed by a number $k$, and each individual follows a deterministic trajectory across grid cells over time.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010K - Unique Disk Identifier

Each input describes a disk made of concentric circular sectors. The $i$-th sector is a ring split into $Ai$ equal positions, and each position is painted with one of $K$ colors. So every sector is essentially a colored cyclic array whose length depends on the sector index.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010J - New Language

We are given several memory blocks, each block has a size that is a power of two. If an element has value $Si$, its actual size is $2^{Si}$, and it also comes with a strict alignment rule: it can only be placed at a memory address divisible by $2^{Si}$.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010F - Find The Tree ?

We are given, for every node in an unknown tree, the identity of one special node: the node that is farthest from it in terms of shortest-path distance.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010H - Hide the Money

We are working on an $N times M$ grid where every cell represents a possible hiding location for a money bag. Yessine will place exactly $K$ bags, with at most one per cell.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010G - Grid Crash

We are given a very small grid, at most 5 by 5, filled with two possible colors, black and white. The game repeatedly removes connected regions of the same color, and each removal causes a physical reconfiguration of the grid: cells above fall down to fill gaps, and then empty…

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010E - Enemies of the heir... beware

We are given a sequence $P$ that is supposed to behave like a prefix-function array of some hidden integer array $A$.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010D - Divisibility Game

We are given an array of positive integers and a fixed odd integer $k$. Two players take turns transforming the array. A move consists of choosing two elements, removing them, and appending their sum.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010A - Maximal String

We are given a binary string and allowed to repeatedly perform a local transformation on adjacent equal characters. Whenever we see two consecutive 0s, we may delete them and insert a single 1.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010B - Balanced Tournament

We are given several independent scenarios. In each scenario, there are $N$ champions, each with an initial strength value.

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010C - Cryptocurrency

We are given several independent test cases. Each test case contains a sequence of prices over time. The task is to look at every contiguous segment of time where the prices strictly increase step by step, and measure how much the price rises from the beginning of that segment…

Practice › Codeforces Solutions › Winter Cup 6.0 Online Mirror Contest ›

CF 105010I - Inclusion and Diversity

Each candidate can be represented purely by which of the $m$ minority groups they belong to. So every applicant corresponds to a subset of a set of size $m$, and the pool contains all $2^m$ possible subsets.