Winter Cup 4.0 Online Mirror Contest

12 problems from Winter Cup 4.0 Online Mirror Contest (contest 105017), difficulty -. 9/12 solutions verified against sample I/O.

12 items

Winter Cup 4.0 Online Mirror Contest

Special | 12 problems | 9/12 verified | Difficulty - | 9m 12s

#	Problem	Time	✓
A	Group of Permutations	28s
B	Simulation	55s	✓
C	Co-sortable Strings	49s	✓
D	Decrypting the Password	54s	✓
E	Exam	57s	✓
F	800	35s	✓
G	Game of Cards	52s
I	Non-Increasing Dilemma	44s	✓
J	Journey Through Time	55s	✓
K	Count the squares	41s	✓
L	Two Shortest Paths	30s
M	Mean Absolute Deviation	52s	✓

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

CF 105017M - Mean Absolute Deviation

We are given an array of real numbers and many range queries. For each query, we take the subarray defined by its endpoints, compute its arithmetic mean, and then measure how far the elements deviate from this mean using the average of absolute differences.

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

CF 105017K - Count the squares

We are given a grid formed by unit squares, with height $N$ and width $M$. Inside this grid, we want to count how many axis-aligned squares exist, considering all possible sizes.

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

CF 105017L - Two Shortest Paths

Working

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

CF 105017J - Journey Through Time

We are given a tree where each node represents a moment in time, and each node carries a non-negative damage value. A subset of nodes is marked as special, and we must start from node 1 and eventually visit all of these special nodes in any order.

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

CF 105017G - Game of Cards

Two players start with two equal-sized collections of numbers. These numbers are not directly compared; instead, they are gradually “decomposed” during a game.

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

CF 105017I - Non-Increasing Dilemma

We are given an array of integers and an operation that aggressively reshapes it. In one move, we pick an index i, and then we add a[i] to every other element in the array, leaving a[i] unchanged.

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

CF 105017E - Exam

We are given a square grid of size n by n that must be filled with zeros and ones. Each cell represents whether we place a black square (1) or leave it white (0).

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

CF 105017D - Decrypting the Password

We are given a long string of decimal digits, and we need to count how many of its contiguous substrings represent numbers divisible by 11 when interpreted as integers.

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

CF 105017F - 800

We are given an $N times M$ grid of lowercase letters. We are allowed to repeatedly perform a very specific operation: pick any cell $(i, j)$, choose a positive integer $k$, and copy its character to either $(i-k, j-k)$ or $(i-k, j+k)$, provided those target cells stay inside…

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

CF 105017A - Group of Permutations

Working

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

CF 105017B - Simulation

We are simulating a very simple random process repeated many times. We start with an array of size $n$, initially all zeros. Then we perform $m$ independent operations, and each operation picks one of the $n$ positions uniformly at random and increments it by one.

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

CF 105017C - Co-sortable Strings

We are given two strings of equal length. At every position, we can look at the pair of characters formed by taking one character from the first string and one from the second string.