ABBYY Cup 3.0 - Finals (online version)

12 problems from ABBYY Cup 3.0 - Finals (online version) (contest 331), difficulty 1100-3100. 8/12 solutions verified against sample I/O.

12 items

ABBYY Cup 3.0 - Finals (online version)

Special | 12 problems | 8/12 verified | Difficulty 1100-3100 | 19m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A1	Oh Sweet Beaverette	1400	brute-force, implementation	1,528	1m 6s	✓
A2	Oh Sweet Beaverette	1500	data-structures, sortings	1,546	1m 27s	✓
B1	Shave Beaver!	1700	implementation	808	1m 21s	✓
B2	Shave Beaver!	1900	data-structures	831	1m 26s	✓
C1	The Great Julya Calendar	1100	dp	7,085	1m 48s	✓
C2	The Great Julya Calendar	2400	dp	440	1m 11s	✓
C3	The Great Julya Calendar	2500	dp	624	1m 16s	✓
D1	Escaping on Beaveractor	2400	dfs-and-similar, implementation	223	2m 12s
D2	Escaping on Beaveractor	2600	graphs	158	1m 58s	✓
D3	Escaping on Beaveractor	3000	data-structures, implementation, trees	203	1m 45s
E1	Deja Vu	2900	constructive-algorithms, graphs, implementation	218	1m 57s
E2	Deja Vu	3100	constructive-algorithms, dp	236	1m 53s

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331B1 - Shave Beaver!

We are given a permutation of the numbers from 1 to n, but the permutation is not just data, it defines a fixed ordering of “beavers in a line”. Each number appears exactly once, but the position of each value changes over time due to swaps.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331A1 - Oh Sweet Beaverette

We are given a linear sequence of trees, each carrying an integer value that represents how aesthetically pleasing that tree is. We are allowed to remove any subset of these trees, keeping the remaining ones in their original order.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331E2 - Deja Vu

The problem gives a directed graph where vertices represent locations and edges represent streets between them. Every street has two pieces of information: where it goes, and a fixed sequence of “visions”, which is just a list of vertices.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331E1 - Deja Vu

We are asked to model Neo's “deja vu” experiences as paths in a directed graph. The graph nodes represent shops, and directed edges represent streets. Each edge carries a sequence of visions, which is a list of shop indices that Neo sees when traveling that edge.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331D3 - Escaping on Beaveractor

We are asked to simulate the movement of a vehicle, the Beaveractor, inside a square campus. The campus is a grid from (0,0) to (b,b).

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331D2 - Escaping on Beaveractor

We are asked to simulate the movement of a “Beaveractor” on a square campus of size b×b. The campus contains several arrows that act like teleportation instructions: whenever the Beaveractor reaches an arrow, it immediately changes its direction to match the arrow and…

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331D1 - Escaping on Beaveractor

We are asked to simulate the motion of a "Beaveractor" on a square campus of size $b times b$. The campus contains a set of directional arrows, each either horizontal or vertical, which force the Beaveractor to change its motion direction when it crosses them.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331C3 - The Great Julya Calendar

We are asked to reduce a positive integer to zero by repeatedly subtracting one of its digits. On each step, you must choose any digit that is present in the current number and subtract it. The goal is to minimize the number of subtraction operations needed to reach zero.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331C2 - The Great Julya Calendar

We are given a positive integer n representing a "magic number" from the Julya calendar. The Smart Beaver can reduce n to zero by repeatedly subtracting one of its digits. For instance, if n = 24, the Beaver could subtract 2 or 4, producing 22 or 20 respectively.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331C1 - The Great Julya Calendar

We start with a non-negative integer n. In one operation, we look at the decimal representation of the current number, choose any digit that appears in it, and subtract that digit from the number.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331B2 - Shave Beaver!

We are given a permutation of n beavers, each with a unique ID from 1 to n. A high-tech machine can shave beavers in consecutive ID intervals, but only if the permutation contains all IDs in that interval in increasing order, not necessarily consecutively in positions.

Practice › Codeforces Solutions › ABBYY Cup 3.0 - Finals (online version) ›

CF 331A2 - Oh Sweet Beaverette

We are given a linear sequence of trees, each with an integer esthetic appeal. The task is to remove some trees so that three conditions hold. First, the sum of the remaining trees' appeals is maximized.