ABBYY Cup 3.0 - Finals (online version)

Solutions for ABBYY Cup 3.0 - Finals (online version) (contest 331). 3/7 problems verified against sample I/O. Difficulty range: 1100-2900.

7 items

ABBYY Cup 3.0 - Finals (online version)

Type: Special | Problems: 7 | Verified: 3/7 | Rating range: 1100-2900 | Time: 27m 55s

Problem	Name	Rating	Tags	Solve Time	Verified
B1	Shave Beaver!	1700	implementation	2m 32s	✓
C1	The Great Julya Calendar	1100	dp	4m 55s	✓
C2	The Great Julya Calendar	2400	dp	5m 52s	✗
C3	The Great Julya Calendar	2500	dp	1m 53s	✓
D1	Escaping on Beaveractor	2400	dfs-and-similar, implementation	3m 8s	✗
D2	Escaping on Beaveractor	2600	graphs	3m 7s	✗
E1	Deja Vu	2900	constructive-algorithms, graphs, implementation	6m 28s	✗

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

CF 331B1 - Shave Beaver!

We are given a permutation of numbers from 1 to n, and we repeatedly modify it by swapping positions. On top of that, we are asked queries about intervals of values, not positions.

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

CF 331C1 - The Great Julya Calendar

We are asked to minimize the number of steps required to reduce a given integer n to zero. Each step consists of choosing a digit from the current number and subtracting it from that number.

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

CF 331C2 - The Great Julya Calendar

We start with a non-negative integer. In one operation, we may choose any digit that currently appears in the number and subtract that digit from the number itself.

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

CF 331C3 - The Great Julya Calendar

We are given a single non-negative integer, called the magic number. At each step, we can subtract from it any of its digits to produce a new number. We repeat this operation until the number reaches zero.

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

CF 331D1 - Escaping on Beaveractor

We have a square campus with coordinates from (0, 0) to (b, b). Inside the square there are several directed segments, called arrows. Every arrow is either horizontal or vertical, and no two arrows intersect or even touch.

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

CF 331D2 - Escaping on Beaveractor

We have a square campus with coordinates from (0, 0) to (b, b). Inside the campus there are several directed axis-aligned segments, called arrows. Each arrow is either horizontal or vertical, and the arrows never intersect or touch.

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

CF 331E1 - Deja Vu

We are given a directed graph of shops and streets. Every directed edge has an attached sequence of shop numbers called a vision. Whenever Neo traverses that edge, he sees exactly that sequence.