IU Programming Challenge 2024

6 problems from IU Programming Challenge 2024 (contest 105059), difficulty -. 6/6 solutions verified against sample I/O.

6 items

IU Programming Challenge 2024

Special | 6 problems | 6/6 verified | Difficulty - | 5m 18s

#	Problem	Time	✓
A	Luddy Rocks	45s	✓
B	Bus Routes	59s	✓
C	SeaTac	53s	✓
D	Assignment Allocation	52s	✓
E	Mole Whacking Robots	1m	✓
F	Average of Averages	49s	✓

Practice › Codeforces Solutions › IU Programming Challenge 2024 ›

CF 105059C - SeaTac

We are given a connected undirected graph that represents a city, where intersections are nodes and roads are edges. A car starts at node 1 and must reach node n. Every road costs exactly one unit of fuel to traverse.

Practice › Codeforces Solutions › IU Programming Challenge 2024 ›

CF 105059D - Assignment Allocation

We are given a semester divided into days, and a collection of assignments. Each assignment is available only during a fixed interval of days, from its start day to its deadline day, and it can be completed on any single day inside that interval.

Practice › Codeforces Solutions › IU Programming Challenge 2024 ›

CF 105059B - Bus Routes

We are given a street with stops labeled from 1 to n, and we want to move from stop 1 to stop n. Movement is free only when it happens through bus routes, and otherwise it costs exactly the distance walked along the line. Each bus route is an interval [L, R].

Practice › Codeforces Solutions › IU Programming Challenge 2024 ›

CF 105059F - Average of Averages

We are given an integer array and we look at every contiguous segment of it. For each segment, we compute its average value, meaning the sum of elements in that segment divided by its length. The task is to take all these segment averages and compute their overall mean.

Practice › Codeforces Solutions › IU Programming Challenge 2024 ›

CF 105059E - Mole Whacking Robots

We have a line of $n$ holes labeled from 1 to $n$. Each hole contains a single mole, and every mole appears exactly once during a game that lasts $n$ seconds.

Practice › Codeforces Solutions › IU Programming Challenge 2024 ›

CF 105059A - Luddy Rocks

The task is essentially about checking whether a fixed target word can be constructed from the letters available in a given string. For each test case, we are given a “banner” made of uppercase letters.