Harker Programming Invitational 2023 Advanced

10 problems from Harker Programming Invitational 2023 Advanced (contest 104236), difficulty -. 7/10 solutions verified against sample I/O.

10 items

Harker Programming Invitational 2023 Advanced

Special | 10 problems | 7/10 verified | Difficulty - | 13m 4s

#	Problem	Time	✓
A	Aranara Game (Easy)	1m 17s	✓
B	Perfect Parks	1m 16s	✓
C	Testing Building Strength	1m 28s
D	J IDs	1m 22s	✓
E	Wifi Connection	1m	✓
F	Meltdown	1m 19s	✓
G	Aranara Game (Hard)	1m 7s	✓
H	Environmental Policy	1m 25s
I	Possible Meetings	1m 9s	✓
J	Discount Spiderman	1m 41s

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236J - Discount Spiderman

We are given a set of vertical “trees” placed at distinct x-coordinates. Each tree is just a segment from ground level up to some height. Alice starts at the leftmost side and moves strictly from left to right, but she does not move along the ground.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236H - Environmental Policy

We are given an array of integers representing environmental impact scores for different policies. Each query asks us to look inside a fixed segment of this array and consider only subarrays whose lengths lie inside a given range.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236I - Possible Meetings

We are given a sequence of animals arranged in a line. Each animal has two attributes: a species label and a skill value. The task is to consider every contiguous segment of this line and compute a score for each segment.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236G - Aranara Game (Hard)

We are given a directed graph on $N$ nodes where every node has exactly one outgoing edge. From each node $i$, there is a deterministic move to $nxti$. Two tokens start on nodes $a$ and $b$. In every round, both tokens simultaneously follow their outgoing edges.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236F - Meltdown

We are given a row of $N$ ice pillars, each with an initial integer height. Over time, the system receives two kinds of operations applied to subarrays.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236D - J IDs

We are given a rectangular grid, and two players are placed on two different cells. The grid has no obstacles, so movement is always possible in the four cardinal directions.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236E - Wifi Connection

We are given a set of points on a 2D plane, each representing an observation station in a national park. Every station is equipped with a wireless device that has a uniform power level $P$.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236C - Testing Building Strength

We are given a chain of rigid segments placed end to end in the plane. Each segment has a fixed length, and consecutive segments are connected by joints that allow rotation.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236A - Aranara Game (Easy)

We are given a directed structure on $N$ nodes where each node has exactly one outgoing edge to another node, and no node points to itself.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Advanced ›

CF 104236B - Perfect Parks

We are given an ordering of the numbers from 1 to N placed across N positions. Think of the array a as Larry’s “ideal layout”, where position i ideally wants the value a[i]. Harry is allowed to rearrange the same set of values 1 through N into another permutation b.