North American Southeast Regional 2019 (Div 1)

11 problems from North American Southeast Regional 2019 (Div 1) (contest 102423), difficulty -. 11/11 solutions verified against sample I/O.

11 items

North American Southeast Regional 2019 (Div 1)

Special | 11 problems | 11/11 verified | Difficulty - | 56m 45s

#	Problem	Time	✓
A	Carryless Square Root	3m 48s	✓
B	Computer Cache	3m	✓
C	Elven Efficiency	2m 3s	✓
D	Swap Free	4m 45s	✓
E	Fixed Point Permutations	1m 55s	✓
F	Interstellar Travel	3m 30s	✓
G	Jumping Path	2m 41s	✓
H	Levenshtein Distance	1m 19s	✓
I	Maze Connect	3m 7s	✓
J	One of Each	1m 23s	✓
K	Windmill Pivot	29m 14s	✓

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423B - Computer Cache

The cache is an array of n byte addresses, initially filled with zero. We also have m independent data pieces, where each piece is itself a byte array. A load operation copies an entire piece into a consecutive region of the cache, replacing whatever was there.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423K - Windmill Pivot

We have n distinct points in the plane, with no three on the same line. A windmill consists of a line and a current pivot point on that line. The line rotates clockwise around the pivot until it first reaches another point, which becomes the new pivot.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423H - Levenshtein Distance

We are given a finite alphabet consisting of distinct lowercase letters, already written in alphabetical order, and a query string whose characters all belong to that alphabet.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423I - Maze Connect

The input describes a maze whose walls are drawn diagonally. Each character position is a small square in the ASCII representation. A dot means that square contains no wall. A slash or backslash is a diagonal wall segment inside that square.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423A - Carryless Square Root

The operation in this problem looks like ordinary multiplication, except that every addition performed inside the multiplication discards carries.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423J - One of Each

We have a sequence (X) of (n) integers. Every element is between (1) and (k), and every value from (1) through (k) occurs somewhere in the sequence. We need to delete some elements while preserving the relative order of everything that remains.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423G - Jumping Path

We have a rooted tree. Every vertex has an integer label. A jumping path is a sequence of vertices taken strictly downward through the tree, where every earlier vertex is an ancestor of every later vertex.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423F - Interstellar Travel

We have (N) stars around Earth. For each star (i), three values describe its contribution to the spaceship's travel distance.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423E - Fixed Point Permutations

A permutation of size n rearranges the numbers 1,…,n so that every number appears exactly once. Position i is a fixed point when the value placed there is also i.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423C - Elven Efficiency

The problem describes a sequence of stone piles, one for each animal. An animal starts with some number of stones. Then, in each round, a number k is announced.

Practice › Codeforces Solutions › North American Southeast Regional 2019 (Div 1) ›

CF 102423D - Swap Free

We are given (N) distinct words. Every word is an anagram of every other word, and no letter occurs twice inside a word. We want to choose as many words as possible so that no two chosen words can be obtained from one another by swapping exactly one pair of positions.