MITIT 2024 Combined Round

6 problems from MITIT 2024 Combined Round (contest 104935), difficulty -. 0/6 solutions verified against sample I/O.

6 items

MITIT 2024 Combined Round

Special | 6 problems | 0/6 verified | Difficulty - | 10m 56s

# Problem Rating Tags Accepted Time ✓
A Monotonically Increasing Tardiness Informatics Tournament 4m 10s
B Min-Max Game 1m 12s
C Tromino Packing 1m 20s
D Tree 2-Coloring 1m 15s
E Connecting Buildings 1m 37s
F Array Gerrymandering 1m 22s
Practice › Codeforces Solutions › MITIT 2024 Combined Round ›

CF 104935A - Monotonically Increasing Tardiness Informatics Tournament

There are several organizers, each one getting progressively more late as meetings go on. The delay of each organizer does not stay fixed: for a given person, their lateness in the first meeting is known, and then every subsequent meeting they become even later by a fixed…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › MITIT 2024 Combined Round ›

CF 104935F - Array Gerrymandering

We are given a binary string for each test case, where each position represents a city that either supports Busy Beaver (1) or Lazy Lemur (0). We are allowed to partition this array into exactly $K$ contiguous nonempty segments, and each segment is considered a district.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › MITIT 2024 Combined Round ›

CF 104935E - Connecting Buildings

We are given several buildings placed around a circle. Each building has a fixed position on the circle and a height. There is also a special building at the center whose height is not fixed in advance; instead, it is given separately for each query.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › MITIT 2024 Combined Round ›

CF 104935D - Tree 2-Coloring

We are building a tree one vertex at a time. Initially there is only vertex 1. Each query adds a new vertex and connects it to some existing vertex, so the structure always remains a rooted-growing tree.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › MITIT 2024 Combined Round ›

CF 104935C - Tromino Packing

The grid can be thought of as a board where some cells are blocked, some are irrelevant empty space, and some cells are special anchors marked with o. Every o cell must become the center of an L-shaped tromino.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › MITIT 2024 Combined Round ›

CF 104935B - Min-Max Game

We are given a list of integers arranged in a line. Two players repeatedly compress this line until only one number remains. A move always picks two adjacent elements, removes them, and replaces them with a single value derived from the pair.
codeforces competitive-programming Jun 28, 2026