MITIT 2024 Advanced Round

6 problems from MITIT 2024 Advanced Round (contest 104937), difficulty -. 1/6 solutions verified against sample I/O.

6 items

MITIT 2024 Advanced Round

Special | 6 problems | 1/6 verified | Difficulty - | 6m 23s

#	Problem	Time	✓
A	Multisets	1m 11s
B	Beavers and Revaebs	1m 58s
C	Square Coloring Game	1m 22s
D	K-Good Subsequences	37s
E	Monitoring Beavers	26s
F	Solving Equations	49s	✓

Practice › Codeforces Solutions › MITIT 2024 Advanced Round ›

CF 104937E - Monitoring Beavers

We are given a directed system of relationships between beavers. Each input edge represents a pair of beavers where one currently monitors the other.

Practice › Codeforces Solutions › MITIT 2024 Advanced Round ›

CF 104937C - Square Coloring Game

We are given a one-dimensional board made of cells, each cell being either red, green, or white. Two players alternate turns, and on each turn a player tries to “activate” a small cluster of white cells that are close to each other.

Practice › Codeforces Solutions › MITIT 2024 Advanced Round ›

CF 104937B - Beavers and Revaebs

We are choosing an integer value for each of $N$ problems, with each value constrained to lie in its own interval $[lk, rk]$. Once the values are fixed, they define a prefix-sum sequence: the $i$-th beaver’s score is the sum of the first $i$ chosen values.

Practice › Codeforces Solutions › MITIT 2024 Advanced Round ›

CF 104937D - K-Good Subsequences

We are given an initial sequence a that must appear as a prefix of a longer sequence b. The values in b are integers between 1 and M. After this prefix, we are allowed to append more elements freely.

Practice › Codeforces Solutions › MITIT 2024 Advanced Round ›

CF 104937A - Multisets

We maintain a growing sequence where each position stores a multiset of positive integers. Initially the sequence is empty, and each operation appends a new multiset derived from earlier ones. There are four ways to construct a new multiset.

Practice › Codeforces Solutions › MITIT 2024 Advanced Round ›

CF 104937F - Solving Equations

Each test case describes a small system of polynomial equations over positive integers. Every variable is one of the first letters of the alphabet, and each equation is a sum of terms where a term is a coefficient multiplied by a product of variables.