Lexington Informatics Tournament (LIT) 2023

10 problems from Lexington Informatics Tournament (LIT) 2023 (contest 104511), difficulty -. 3/10 solutions verified against sample I/O.

10 items

Lexington Informatics Tournament (LIT) 2023

Special | 10 problems | 3/10 verified | Difficulty - | 20m

#	Problem	Time	✓
A	Chunky Turnip Fan Club	1m 30s	✓
B	Bessie's Money	1m 17s	✓
C	Tree Folding	3m 56s
D	Hillington	1m 42s
E	Awesome Hack for Free GPA	1m 38s
F	Love at Cafe Liebe (Easy Version)	2m 19s
G	Taking Breaks	1m 34s
H	Axington	2m 32s
I	Love at Cafe Liebe (Hard Version)	1m 42s
J	Tyger's Minecraft Park	1m 50s	✓

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511J - Tyger's Minecraft Park

We are given a set of axis-aligned square obstacles placed on an infinite 2D grid. Each obstacle is fixed in position and cannot be crossed. On top of that, we have multiple queries involving a moving square “agent” of fixed side length per query.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511H - Axington

We are given a grid where some cells contain trees and others are empty ground. The goal is to assign a “day number” to every tree cell such that all trees are eventually removed, and the schedule respects a key constraint: a tree can only be removed on a day if it is…

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511I - Love at Cafe Liebe (Hard Version)

We are working with a system of coffee types where each type behaves like a convertible resource. The goal is to end up with as much coffee of type 1 as possible. Initially, Kanako receives a controllable amount of coffee from Sumika.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511F - Love at Cafe Liebe (Easy Version)

We are given several types of coffee, but only type 1 is valuable in the end. The process has two stages. First, we can obtain some initial coffee from Sumika. She can provide any non-negative real amount of coffee, but only for types marked with a 1 in a binary string.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511G - Taking Breaks

We are tracking a sequence of moments when a person checks a clock. Each check happens at a time determined by a recurrence, starting from an initial delay and then evolving based on the previous check time and a small periodic function of the step number.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511C - Tree Folding

We are growing a tree one node at a time. Initially there is a single vertex. Each query attaches a new node to an existing node, so after $i$ queries we have a rooted structure with $i+1$ vertices connected in a tree.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511E - Awesome Hack for Free GPA

We are given two collections of scores, one for each semester. Each semester’s grade is simply the arithmetic mean of its scores, and the final grade is the average of the two semester means.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511D - Hillington

We are given an $n times n$ grid where some cells already have fixed integer values and the rest are unknown. The final grid we want to imagine completing must satisfy a very rigid geometric rule: every pair of edge-adjacent cells must differ in value by exactly 1.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511A - Chunky Turnip Fan Club

We are given a line of fanclubs placed on a number line. Each fanclub sits at a distinct coordinate and contains either one or two members.

Practice › Codeforces Solutions › Lexington Informatics Tournament (LIT) 2023 ›

CF 104511B - Bessie's Money

We are trying to assign coins to six distinct cows so that each cow receives exactly one coin and the total value of all assigned coins equals a target sum $n$.