MITIT Spring 2026 Invitationals Qualification Round 2

5 problems from MITIT Spring 2026 Invitationals Qualification Round 2 (contest 106463), difficulty -. 5/5 solutions verified against sample I/O.

5 items

MITIT Spring 2026 Invitationals Qualification Round 2

Special | 5 problems | 5/5 verified | Difficulty - | 4m 34s

#	Problem	Time	✓
A	Circular Board Game	54s	✓
B	Food Fight	56s	✓
C	Banana Lounge	1m 4s	✓
D	Infinite Market	51s	✓
E	Street Magician	49s	✓

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 2 ›

CF 106463B - Food Fight

We are given a rooted tree that represents a set of stalls connected in a hierarchy. The way we “visit” these stalls is fixed by a DFS-like traversal, and the order in which we first enter each subtree determines how we assign each stall to one of two teams.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 2 ›

CF 106463D - Infinite Market

We are given a directed structure of “portals” between stalls in a market. Each portal is itself a directed edge from one stall to another, and every portal also has a designated “next portal” that is forced after using it.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 2 ›

CF 106463E - Street Magician

We are given a sequence of integers, and we are allowed to rearrange it using a special notion of when two elements are “compatible to be inverted”.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 2 ›

CF 106463C - Banana Lounge

We are given a line of rooms, each room having a height. The “banana supply” of a room configuration is determined by how these heights interact with a monotonic structure: each room contributes to some global total depending on how far it extends its influence until a…

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 2 ›

CF 106463A - Circular Board Game

We are given a circular board with $N$ positions labeled from $0$ to $N-1$. A player starts on some position $Y$.