mBIT Advanced November 2020

12 problems from mBIT Advanced November 2020 (contest 102824), difficulty -. 3/12 solutions verified against sample I/O.

12 items

mBIT Advanced November 2020

Special | 12 problems | 3/12 verified | Difficulty - | 10m 42s

#	Problem	Time	✓
A	Climbing Trees	1m 5s	✓
B	Stone Piles	49s	✓
C	Calendars	43s
D	The Duplicator	34s
E	Locked in the Past	25s
F	Night of the Candles	31s
G	Gemstones	33s	✓
H	The Flock of Rams	4m 25s
I	Textile Display	23s
J	Tanya's Revenge	27s
K	Sphinx Economics	25s
L	Building Atlantis	22s

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824G - Gemstones

We have a collection of rocks, where each rock is described by a string of lowercase letters. A letter represents a mineral type that appears inside that rock.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824F - Night of the Candles

I can write the editorial, but the problem statement section is empty, and I could not reliably identify the exact Codeforces problem from only “102824F - Night of the Candles”.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824E - Locked in the Past

I can write the editorial, but the actual problem statement for Codeforces 102824E “Locked in the Past” is missing from the prompt. The sections titled Problem Statement, Input, and Output are empty, and I could not reliably identify the problem from the title alone.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824B - Stone Piles

We have several stacks of stones. Every stone has a type, and a stone of type i must finally end up in pile i. A move takes the stone currently on top of one non-empty pile and places it on top of another pile.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824C - Calendars

I can write the editorial, but the problem statement section in your prompt is empty, and I do not have enough information to reliably reconstruct the intended algorithm for Codeforces 102824C - Calendars.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824L - Building Atlantis

I can write the editorial, but the problem statement section you provided is empty, and I could not identify the exact “Codeforces 102824L - Building Atlantis” problem from the available information.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824K - Sphinx Economics

I can write the full editorial, but I’m missing the actual problem statement for Codeforces Gym 102824K - Sphinx Economics.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824J - Tanya's Revenge

I can write the editorial, but I need the actual problem statement for Codeforces 102824J “Tanya's Revenge” first.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824I - Textile Display

I need the problem details to write a correct editorial, since the statement section is empty and the title alone is not enough to determine the algorithm. Please provide the missing statement or a link to the problem. Waiting for your answer

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824H - The Flock of Rams

I can write this editorial, but the requested format is longer than can fit in a single response while also including the full Python implementation, worked traces, assert-based tests, and all required explanations.

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824D - The Duplicator

I can write the editorial, but I need the actual problem statement for Codeforces 102824D - The Duplicator. The statement content is not included in your prompt, and I could only verify the problem title and contest page, not the full description, input format, constraints, or…

Practice › Codeforces Solutions › mBIT Advanced November 2020 ›

CF 102824A - Climbing Trees

The problem describes a tree whose edges have integer weights. The cost of moving between two vertices is not the sum of the edge weights on the tree path. Instead, the cost of a direct move between two vertices is the bitwise XOR of all edge weights on their unique tree path.