2020-2021 Winter Petrozavodsk Camp, Day 9 Contest (XXI Open Cup, Grand Prix of Suwon)
12 problems from 2020-2021 Winter Petrozavodsk Camp, Day 9 Contest (XXI Open Cup, Grand Prix of Suwon) (contest 102979), difficulty -. 2/12 solutions verified against sample I/O.
2020-2021 Winter Petrozavodsk Camp, Day 9 Contest (XXI Open Cup, Grand Prix of Suwon)
Special | 12 problems | 2/12 verified | Difficulty - | 18m 47s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Another Tree Queries Problem | 2m 26s | ||||
| B | Best Meeting Places | 41s | ||||
| C | Colorful Squares | 2m 34s | ||||
| D | Designing a PCB | 46s | ✓ | |||
| E | Expected Distance | 31s | ||||
| F | Find the XOR | 50s | ✓ | |||
| G | Generate The Array | 2m 43s | ||||
| H | Hotspot-2 | 29s | ||||
| I | Integer Array Shuffle | 29s | ||||
| J | Junkyeom's Contest | 2m 18s | ||||
| K | Knowledge Is... | 2m 31s | ||||
| L | Lights On The Road | 2m 29s |
CF 102979J - Junkyeom's Contest
Let $U$ denote the set underlying the multicombinations (92). In the representation (6), each multicombination is a nonincreasing sequence $$dt ge d{t-1} ge cdots ge d1,qquad s ge dt,$$ and its complement with respect to $U$ is formed by taking the elements of $U$ not…
CF 102979A - Another Tree Queries Problem
Let $U = {0,1,dots,n-1}$ with $n ge s+t$. Let $A subseteq binom{U}{s}$ and $B subseteq binom{U}{t}$ be cross-intersecting, meaning $alpha cap beta ne varnothing$ for all $alpha in A$ and $beta in B$.
CF 102979L - Lights On The Road
Theorem W is proved in Section 7.2.1.3 under the standing assumption that the parameters $m1 le m2 le cdots le mn$.
CF 102979K - Knowledge Is...
Theorem W is proved in Section 7.2.1.3 under the standing assumption that the parameters $m1 le m2 le cdots le mn$.
CF 102979G - Generate The Array
Let Theorem W be applied to the torus $T(m1,dots,mn)$ with cross order as in Section 7.2.1.3, and let $S$ be an initial segment in that order.
CF 102979I - Integer Array Shuffle
The prompt is missing the actual problem statement for “Codeforces 102979I - Integer Array Shuffle”, so there is not enough information to reconstruct the task, constraints, or required transformation.
CF 102979H - Hotspot-2
I can’t reliably write a correct editorial for Codeforces 102979H - Hotspot-2 because the actual problem statement, constraints, and I/O format are missing from your prompt.
CF 102979F - Find the XOR
We are given a connected undirected graph with up to 100,000 vertices and edges. Each edge has a nonnegative weight.
CF 102979C - Colorful Squares
Let Theorem W be applied to the torus $T(m1,dots,mn)$ with cross order as in Section 7.2.1.3, and let $S$ be an initial segment in that order.
CF 102979E - Expected Distance
The problem statement is missing, so I can’t safely derive the model, the solution, or any correctness argument yet.
CF 102979D - Designing a PCB
We are given a line of pads placed on a straight horizontal axis. Each pad is located at an integer coordinate, and every pad is labeled with a number from 1 to n, with each label appearing exactly twice.
CF 102979B - Best Meeting Places
The problem statement is missing, so there isn’t enough information to reliably reconstruct what Codeforces 102979B (“Best Meeting Places”) is asking.