2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)

13 problems from 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) (contest 102433), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)

Div. 1 | 13 problems | 13/13 verified | Difficulty - | 32m 2s

#	Problem	Time	✓
A	Radio Prize	1m 26s	✓
B	Perfect Flush	3m 6s	✓
C	Coloring Contention	1m 47s	✓
D	Dividing By Two	5m 33s	✓
E	Rainbow Strings	3m 29s	✓
F	Carny Magician	2m 17s	✓
G	Glow, Little Pixel, Glow	1m 26s	✓
H	Pivoting Points	3m 16s	✓
I	Error Correction	1m 30s	✓
J	Interstellar Travel	2m 49s	✓
K	Computer Cache	2m 30s	✓
L	Carry Cam Failure	1m 13s	✓
M	Maze Connect	1m 40s	✓

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433F - Carny Magician

We need to arrange the numbers from (1) to (n) into a permutation. Position (i) is called fixed when the value placed there is also (i). Among all permutations with exactly (m) fixed positions, we must output the (k)-th one in lexicographic order.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433C - Coloring Contention

We have a connected undirected graph whose vertices are numbered from 1 to (N). Alice assigns one of two colors to every edge. After seeing the coloring, Bob chooses a route from vertex 1 to vertex (N).

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433K - Computer Cache

There are two kinds of mutable state in the problem, and separating them is the key to the whole solution. The cache has n byte positions and starts entirely at zero. Separately, there are m source arrays.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433L - Carry Cam Failure

The operation in this problem is ordinary decimal multiplication with one crucial change: whenever several products land in the same decimal position, their sum is taken modulo 10, so no carry ever moves to the next position.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433M - Maze Connect

The input is a rectangular drawing of an orthogonal maze after a 45 degree rotation. Each non-dot character represents one diagonal wall segment inside its input cell.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433J - Interstellar Travel

Each star is described by three values. Its maximum contribution is (Ti), it loses (si) units of contribution per radian of angular misalignment, and its preferred direction is (ai).

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433I - Error Correction

We have a collection of (N) distinct words. Every word uses exactly the same set of letters, so each word is simply a different permutation of the same letters. No letter appears twice inside one word.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433H - Pivoting Points

We have a set of at most 2000 points in the plane, with no three points on one line. A windmill consists of a rotating line and one point that currently acts as its pivot. The line rotates clockwise.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433G - Glow, Little Pixel, Glow

Each pulse travels along exactly one wire, either horizontally or vertically. A horizontal pulse on wire a starts at the left edge at time t, while a vertical pulse on wire a starts at the bottom edge at the same kind of reference time.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433A - Radio Prize

The cities and roads form a weighted tree. Each city (i) has a tax value (ti), and the cost of sending a ticket from city (u) to city (v) is [ (tu+tv)d(u,v), ] where (d(u,v)) is the total road toll along the unique path between the two cities.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433E - Rainbow Strings

We have a lowercase string, and we want to count its subsequences whose chosen characters are all different. A subsequence is determined by the positions we choose, so choosing the first a from aab and choosing the second a are different subsequences, even though both produce…

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433D - Dividing By Two

We start with an integer (A) and want to turn it into (B). At any moment, we may increase the current value by one, or divide it by two when the current value is even. Every operation costs one, so the task is to find the minimum number of operations.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) ›

CF 102433B - Perfect Flush

We have an array of length (n), and every value from (1) through (k) occurs somewhere in it. We need to delete some elements while preserving the original order, leaving exactly one copy of every value from (1) through (k).