2020-2021 Summer Petrozavodsk Camp, Day 6: XJTU Contest (XXII Open Cup, Grand Prix of XiAn)
11 problems from 2020-2021 Summer Petrozavodsk Camp, Day 6: XJTU Contest (XXII Open Cup, Grand Prix of XiAn) (contest 103329), difficulty -. 9/11 solutions verified against sample I/O.
2020-2021 Summer Petrozavodsk Camp, Day 6: XJTU Contest (XXII Open Cup, Grand Prix of XiAn)
Special | 11 problems | 9/11 verified | Difficulty - | 12m 56s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Yes, Prime Minister | 58s | ✓ | |||
| B | Might and Magic | 54s | ✓ | |||
| C | 0 Tree | 2m 32s | ||||
| D | Decomposition | 52s | ✓ | |||
| E | Median | 57s | ✓ | |||
| F | The Struggle | 53s | ✓ | |||
| G | Power Station of Art | 49s | ✓ | |||
| H | Command and Conquer: Red Alert 2 | 2m 30s | ||||
| I | Typing Contest | 50s | ✓ | |||
| J | Game | 53s | ✓ | |||
| K | Array | 48s | ✓ |
CF 103329H - Command and Conquer: Red Alert 2
Let $rs,dots,r0$ satisfy $$t = rs + cdots + r1 + r0,qquad 0 le rj le mj quad (s ge j ge 0).$$ Write $$Mj = sum{i=0}^j mi,qquad Tj = t - sum{i=j+1}^s ri,$$ so $Tj$ is the remaining sum to be distributed among indices $0,dots,j$ after fixing $rs,dots,r{j+1}$.
CF 103329K - Array
We are given an array $B$ of length $n$, where each position imposes a constraint on how many distinct values we are allowed to use when constructing another array $A$.
CF 103329J - Game
We are working on a two-dimensional integer grid where each cell represents a position $(x, y)$. From any position, the game has a deterministic structure that allows movement along a diagonal direction, specifically from $(x, y)$ to $(x+1, y-1)$, while also having a small set…
CF 103329I - Typing Contest
We are given a group of students, each student has two attributes: a positive weight-like value $fi$ and a performance value $si$.
CF 103329G - Power Station of Art
We are working with two graphs defined on the same set of vertices, where each vertex carries both a number and a color.
CF 103329F - The Struggle
We are given a function defined over a two dimensional index space that behaves like a bitmask grid, where positions correspond to integers up to some limit $n$.
CF 103329C - 0 Tree
Let $rs,dots,r0$ satisfy $$t = rs + cdots + r1 + r0,qquad 0 le rj le mj quad (s ge j ge 0).$$ Write $$Mj = sum{i=0}^j mi,qquad Tj = t - sum{i=j+1}^s ri,$$ so $Tj$ is the remaining sum to be distributed among indices $0,dots,j$ after fixing $rs,dots,r{j+1}$.
CF 103329E - Median
We are given an array where each position is labeled either positive or non-positive. A positive value marks the position as a good object, while a non-positive value marks it as a bad object.
CF 103329D - Decomposition
We are working with a complete graph on $n$ vertices, where every pair of vertices is connected by an undirected edge.
CF 103329A - Yes, Prime Minister
We are asked to answer multiple independent queries on an integer value $x$. For each $x$, we need to construct a short integer interval $[l, r]$ such that the sum of all integers in that interval is a prime number.
CF 103329B - Might and Magic
We are given a character-building style optimization problem where a fixed pool of points must be distributed between different offensive attributes, and the goal is to maximize total damage dealt to an enemy whose health can be considered effectively infinite.