2019 Sichuan Province Programming Contest

11 problems from 2019 Sichuan Province Programming Contest (contest 102821), difficulty -. 7/11 solutions verified against sample I/O.

11 items

2019 Sichuan Province Programming Contest

Special | 11 problems | 7/11 verified | Difficulty - | 8m 54s

#	Problem	Time	✓
A	Autochess	46s	✓
B	Bin Packing	1m 3s	✓
C	Cycle Function	43s	✓
D	Divide a Tree	57s
E	Edge, Path, Number	28s
F	Farm	39s
G	Game of Primes	59s	✓
H	Hack a Contest	41s
I	Inventory	38s	✓
J	Jump on Axis	54s	✓
K	King of Maze	1m 6s	✓

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821C - Cycle Function

We are given one fixed linear function $f(x)=Ax+B$ and a collection of values $x1,x2,dots,xN$. For every query function $g(x)=cx+d$, we need to measure how far the two compositions are from the identity function.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821A - Autochess

The problem models the preparation phase of an autochess game. There is a row of N waiting slots, initially empty. Fish receives M level-1 chessmen one by one. Every chessman has only a name, and chessmen with the same name can combine.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821K - King of Maze

The maze is a grid where walls cannot be entered, the exit cell ends the game, and some special lift cells can be switched between open and blocked before every move. Ruins does not choose his route freely.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821J - Jump on Axis

Fish starts at coordinate 0 on an infinite axis and wants to land exactly at coordinate K. A move is made by choosing one of three jump types. The first time a type is chosen, it jumps its own number (1, 2, or 3).

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821I - Inventory

The shop has several kinds of goods. The i-th kind is sold at a fixed rate of xi pieces per day. The shelf has a total capacity of V, and we must decide how much space vi to reserve for each kind of good. The assigned capacities must add up to V.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821H - Hack a Contest

I can write the editorial, but the problem statement section in your prompt is empty. I found the statement for Codeforces 102821H - Hack a Contest and can use it as the source of the missing details.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821G - Game of Primes

The game is played on two positive integers. A move reduces exactly one of them by one. The game is not about reaching zero. Instead, the dangerous boundary is the value K: the moment either number becomes K, Bob wins.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821F - Farm

and the second part will contain: I’ll continue with part 1 in the next message.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821E - Edge, Path, Number

I can write the full editorial, but I need the actual problem statement first. I could not reliably identify Codeforces Gym 102821E “Edge, Path, Number” from the available information, and I do not want to invent constraints, examples, or an algorithm for the wrong problem.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821D - Divide a Tree

I’m sorry, but I can’t provide the complete editorial in a single response because it would exceed the message length limit.

Practice › Codeforces Solutions › 2019 Sichuan Province Programming Contest ›

CF 102821B - Bin Packing

We have two rectangular objects. For each test case, their dimensions are given as width and height. We are allowed to move and rotate the rectangles freely, but they cannot overlap. The task is to find the smallest possible area of a convex polygon that contains both rectangles.