Mirror of Independence Day Programming Contest 2023 by MIST Computer Club
11 problems from Mirror of Independence Day Programming Contest 2023 by MIST Computer Club (contest 104308), difficulty -. 11/11 solutions verified against sample I/O.
Mirror of Independence Day Programming Contest 2023 by MIST Computer Club
Special | 11 problems | 11/11 verified | Difficulty - | 10m 34s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Rain Rain Go Away, Come Again Another Day! | 1m 3s | ✓ | |||
| B | Signature Nightmare | 53s | ✓ | |||
| C | Optimal Pairing | 1m 3s | ✓ | |||
| D | Unwanted Divisors | 51s | ✓ | |||
| E | Unwanted Divisors Again | 54s | ✓ | |||
| F | Xored Pairs | 1m 10s | ✓ | |||
| G | Keyboard Warrior Roshid | 49s | ✓ | |||
| H | Wonder Island | 46s | ✓ | |||
| I | Colorful Queries | 1m | ✓ | |||
| J | Traveling Alien Masud | 51s | ✓ | |||
| K | An Incantation Long Remembered | 1m 14s | ✓ |
CF 104308K - An Incantation Long Remembered
We are given several “ability strings”, where each ability is made of distinct characters and no character appears in more than one ability.
CF 104308J - Traveling Alien Masud
The earth map can be modeled as a directed graph where each city is a node and each one-way road is a directed edge.
CF 104308I - Colorful Queries
We are given a vertical stack of items, where each item has a color. The top of the stack is position 1, and positions increase as we go downward. A sequence of queries is performed on this stack.
CF 104308H - Wonder Island
We are tracking how a quantity evolves over time when a deterministic growth rule starts applying only after a delay. Saimon begins with some number of identical units, specifically pairs of Emm coins.
CF 104308G - Keyboard Warrior Roshid
We are given multiple test cases. Each test case contains a single lowercase string representing text Roshid wants to type. However, his keyboard has a hardware failure: a specific group of letters no longer works, corresponding to the bottom row of a standard keyboard layout.
CF 104308F - Xored Pairs
We are asked to construct an array of length n where each value is a 30-bit non-negative integer. The construction must satisfy a set of constraints that relate elements either by inequality to a fixed value or by XOR relationships between pairs.
CF 104308E - Unwanted Divisors Again
We are given an integer $m$ and an array $a$. The task is to look at every divisor $d$ of $m$, and decide whether $d$ is “safe” or “bad”. A divisor $d$ is considered bad if there exists at least one array element $ai$ such that $d$ divides $ai$. Otherwise, $d$ is safe.
CF 104308D - Unwanted Divisors
We are given a sequence of integers and then a sequence of queries. For each query value $b$, we are interested in all positive divisors of $b$. Among those divisors, some may appear inside the given array, and others may not.
CF 104308A - Rain Rain Go Away, Come Again Another Day!
The input describes several independent “landscapes” made of vertical stacks of unit-width bricks. Each landscape is an array where the value at position i represents how tall the wall is at that point. When rain falls, water can accumulate in the gaps between taller walls.
CF 104308C - Optimal Pairing
We are given several test cases. In each test case, there is an even-length array. We must partition the array into disjoint pairs so that every element belongs to exactly one pair. For each pair, its contribution to the answer is the larger of the two values inside that pair.
CF 104308B - Signature Nightmare
Each test case describes a process of completing identical forms, where each form requires collecting signatures from several offices. For every office i, a single form requires ai signatures from that office.