Inter University Programming Contest - MU CSE Fest 2025 - MIRROR
10 problems from Inter University Programming Contest - MU CSE Fest 2025 - MIRROR (contest 106208), difficulty -. 9/10 solutions verified against sample I/O.
Inter University Programming Contest - MU CSE Fest 2025 - MIRROR
Special | 10 problems | 9/10 verified | Difficulty - | 11m 32s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Interval and Expected Value | 48s | ✓ | |||
| B | Tree Path Price Queries | 58s | ✓ | |||
| C | Max Person | 1m 13s | ✓ | |||
| D | The New CEO of CloseAI | 1m 1s | ✓ | |||
| E | Toggle the Streetlights | 1m 4s | ✓ | |||
| F | Time Well Spent | 2m 29s | ||||
| G | Awkward Nodes | 52s | ✓ | |||
| H | Guess the Number | 1m 19s | ✓ | |||
| I | Fruit Ninja | 57s | ✓ | |||
| J | Insert Force | 51s | ✓ |
CF 106208A - Interval and Expected Value
We start with a segment of integers $[l, r]$. At any moment, the process maintains two things: the current segment and a running score initialized to zero. Each round consists of two random choices.
CF 106208J - Insert Force
We start with a sequence of non-negative integers. Each move picks two adjacent elements, adds their sum to a running score, and inserts that same sum back into the array between those two elements.
CF 106208G - Awkward Nodes
We are working with a tree where every node is either normal or special. A walk is allowed to move along edges freely, but there is one asymmetry in how nodes behave during the walk: normal nodes can be revisited any number of times, while each special node can appear at most…
CF 106208H - Guess the Number
We are dealing with a hidden parameter game that behaves like a very simple take-away game. There is a pile of stones, and two players alternately remove between 1 and k stones. The player who cannot move loses.
CF 106208I - Fruit Ninja
We are given a tetrahedron in 3D space, fully determined by four non-coplanar points. The task is to cut this solid with a single plane such that the cut divides the tetrahedron into two regions of exactly equal volume.
CF 106208E - Toggle the Streetlights
We are given a line of streetlights, each either on or off. At every minute, all positions are updated at the same time using a purely local rule: only a light that has two neighbors (so every interior position) may change, and it changes only when both of its neighbors were…
CF 106208B - Tree Path Price Queries
We are given a rooted tree where each node represents a location that stores several identical items. Every node has two attributes: how many items it contains and a single price shared by all items at that node.
CF 106208F - Time Well Spent
I can do this, but the problem statement in your message is corrupted and incomplete. Several critical pieces are missing or malformed: - The first line says The first line contains one integer t, but the sample input does not contain t.
CF 106208D - The New CEO of CloseAI
We are given a collection of words separated by spaces. Initially every character is its own token. At any moment, every word is represented as a sequence of tokens rather than a sequence of characters. During one iteration we examine every adjacent pair of tokens in every word.
CF 106208C - Max Person
We are given an unlimited tower of floors. Each floor has exactly $n$ rooms, and each room can hold one person. Placing a person on floor $x$ costs $2x$ units of budget, and we are allowed to place multiple people on the same floor as long as we do not exceed $n$ people there.