Harker Programming Invitational 2023 Novice

10 problems from Harker Programming Invitational 2023 Novice (contest 104237), difficulty -. 9/10 solutions verified against sample I/O.

10 items

Harker Programming Invitational 2023 Novice

Special | 10 problems | 9/10 verified | Difficulty - | 11m 33s

#	Problem	Time	✓
A	Fun with Food Audits	1m 10s	✓
B	Road Intersections	1m	✓
C	Trash Removal	54s	✓
D	Aranara Game (Easy)	57s	✓
E	Tree Counting	1m 10s	✓
F	Perfect Parks	1m 18s
G	Calculating Max Grade	1m 11s	✓
H	Sunset Drifting	1m 8s	✓
I	Mostly Successful Mailman	1m 28s	✓
J	Colossal Cash	1m 17s	✓

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237F - Perfect Parks

We are given a target arrangement of tree heights, where the heights are exactly the integers from 1 to N with no repetition. The array a describes how Larry wants the trees to appear along a line, position by position.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237C - Trash Removal

We are given a sequence of trash piles arranged in a fixed order along a path. Each pile has a weight, and Bob must pick up piles from left to right without skipping or reordering them.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237J - Colossal Cash

We are given a set of barns arranged as vertices in a graph. Each barn gives Joe a fixed profit every time he arrives there. Between barns there are directed roads, each with an associated cost.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237I - Mostly Successful Mailman

We are asked to count how many permutations of the numbers from 1 to N the farmer can produce while making at most K “mistakes”. A mistake occurs at a position i if the value placed at position i is not i itself.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237H - Sunset Drifting

We are given a grid representing a city map where each cell is either free road, an obstacle, a start position, or one or more exits.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237G - Calculating Max Grade

We are given a collection of courses. Each course has two values attached to it: a score and a number of units. We are required to pick exactly K courses.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237E - Tree Counting

We are given a line of blocks, each block having a certain number of trees. A series of walks is also given, where each walk covers a contiguous segment of blocks from one endpoint to another, inclusive.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237D - Aranara Game (Easy)

We are given a directed graph on $N$ nodes where every node has exactly one outgoing edge, defined by an array nxt. From any node $i$, a token moves deterministically to nxt[i] every round.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237A - Fun with Food Audits

Four trash bins are placed around a campus, and at the end of lunch each bin is weighed. Each bin has a known empty weight of six pounds, and the input gives the total measured weight of each bin after use.

Practice › Codeforces Solutions › Harker Programming Invitational 2023 Novice ›

CF 104237B - Road Intersections

We are given a collection of infinite straight lines laid out on a plane. Each line is either vertical, representing an avenue with a fixed x-coordinate, or horizontal, representing a street with a fixed y-coordinate.