Khulna Regional Inter University Programming Contest (KRIUPC) MIRROR
8 problems from Khulna Regional Inter University Programming Contest (KRIUPC) MIRROR (contest 105498), difficulty -. 8/8 solutions verified against sample I/O.
Khulna Regional Inter University Programming Contest (KRIUPC) MIRROR
Special | 8 problems | 8/8 verified | Difficulty - | 8m 18s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Optimal Point | 55s | ✓ | |||
| B | The Fortune Dice | 1m 14s | ✓ | |||
| C | Expected Final Score | 58s | ✓ | |||
| D | Maximum AND | 1m 34s | ✓ | |||
| E | Cyclic Inversion | 59s | ✓ | |||
| F | Make Permutation | 47s | ✓ | |||
| G | User Registration System | 54s | ✓ | |||
| H | Optimizing Weekend Days | 57s | ✓ |
CF 105498B - The Fortune Dice
We are given a single integer that represents a desired total score from rolling a standard six-sided die twice. Each roll produces a value between 1 and 6 inclusive, and the final outcome is the sum of the two results.
CF 105498H - Optimizing Weekend Days
We are given a long continuous period defined by a start date and an end date, and inside this period we also receive a list of public holidays. Each holiday either repeats every year on a fixed month and day, or occurs only once in a specific year.
CF 105498G - User Registration System
We are maintaining a live database of usernames under two operations: insertion and deletion. Each username is a short string, and every operation either tries to add it or remove it. When inserting a username, the system behaves like a reservation mechanism.
CF 105498E - Cyclic Inversion
We are given an array and asked to reason about its inversion count under a restricted but flexible operation. The operation is a cyclic shift applied to the prefix of length k: we can take the first k elements, rotate them left any number of times, and append them back to the…
CF 105498D - Maximum AND
We are given an array of integers. For each value of a parameter $k$, we are allowed to repeatedly perform an operation that takes two positions $i$ and $j$ that are at least $k$ apart and copies the bitwise OR of $aj$ into $ai$.
CF 105498A - Optimal Point
We are given a set of points in four-dimensional Euclidean space. Each point has coordinates $(xi, yi, zi, wi)$. We are allowed to choose a single point $o = (ox, oy, oz, ow)$, and we measure its distance to every input point using standard Euclidean distance in 4D.
CF 105498F - Make Permutation
We are given an array of integers, and for each element we are allowed to repeatedly turn off any single set bit, but only up to once per bit per element, which is equivalent to saying each number can be reduced to any value obtainable by subtracting a sum of distinct powers…
CF 105498C - Expected Final Score
We start with a row of $n$ positions, each containing a distinct element. A pointer $p$ is also given, initially somewhere between $0$ and $n$, inclusive. We repeatedly remove elements from the current row until nothing remains.