Dasha Code Championship - SPb Finals Round (only for onsite-finalists)
7 problems from Dasha Code Championship - SPb Finals Round (only for onsite-finalists) (contest 1210), difficulty 1700-3200. 5/7 solutions verified against sample I/O.
Dasha Code Championship - SPb Finals Round (only for onsite-finalists)
Special | 7 problems | 5/7 verified | Difficulty 1700-3200 | 14m 2s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Anadi and Domino | 1700 | brute-force, graphs | 5,536 | 1m 28s | ✓ |
| B | Marcin and Training Camp | 1700 | brute-force, greedy | 6,039 | 1m 58s | ✓ |
| C | Kamil and Making a Stream | 2000 | math, number-theory, trees | 3,597 | 2m 30s | ✓ |
| D | Konrad and Company Evaluation | 2400 | graphs | 1,625 | 1m 52s | |
| E | Wojtek and Card Tricks | 2700 | math | 440 | 1m 49s | ✓ |
| F1 | Marek and Matching (easy version) | 3100 | brute-force, probabilities | 351 | 2m 41s | ✓ |
| F2 | Marek and Matching (hard version) | 3200 | brute-force, probabilities | 430 | 1m 44s |
CF 1210D - Konrad and Company Evaluation
We are given a group of employees and an undirected “dislike” relation between some pairs. At any moment, each employee has a salary, and this salary induces a directed view of every dislike edge: between two connected employees, the one with higher salary brags to the one…
CF 1210F2 - Marek and Matching (hard version)
We are given a complete bipartite structure between two sets of size $n$, where every potential edge $(elli, rj)$ exists independently with some probability $p{ij}/100$. The randomness is over the presence or absence of each edge, and all edges are independent.
CF 1210F1 - Marek and Matching (easy version)
We are given a complete bipartite structure with $n$ vertices on the left and $n$ vertices on the right. For every possible pair $(i, j)$, the edge between left vertex $i$ and right vertex $j$ exists independently with probability $p{ij}/100$.
CF 1210B - Marcin and Training Camp
We are given a collection of students, each described by two values. The first value encodes which of up to 60 possible algorithms a student knows, and can be thought of as a bitmask. The second value is a skill score.
CF 1210E - Wojtek and Card Tricks
We have a small deck of $k$ cards, numbered 1 through $k$, and Wojtek knows $n$ different deterministic shuffles (permutations) of the deck. Each shuffle specifies exactly where each card ends up.
CF 1210C - Kamil and Making a Stream
We have a rooted tree with root at vertex 1. Every vertex stores a value x[v]. For any ancestor-descendant pair (u, v), we look at the path from u down to v and compute the gcd of all values on that path.
CF 1210A - Anadi and Domino
We are given a very small graph with at most 7 vertices, and a fixed “palette” of 21 dominoes. Each domino corresponds to an unordered pair of values from 1 to 6, so a domino is really a pair like (1,1), (1,2), …, (6,6), with exactly one copy of each pair available.