NUS CS3233 Final Team Contest 2024

13 problems from NUS CS3233 Final Team Contest 2024 (contest 105114), difficulty -. 5/13 solutions verified against sample I/O.

13 items

NUS CS3233 Final Team Contest 2024

Special | 13 problems | 5/13 verified | Difficulty - | 19m 54s

# Problem Rating Tags Accepted Time ✓
A An Easy Array Problem 1m 51s
B Batch GCD 1m 11s ✓
C Cake Cutting 1m 25s
D Don't be Perfect 1m 48s
E Economic Inequality 1m 10s ✓
F False Sanctum: Act 2 1m 15s
G Gear Wheels 1m 26s
H Hard Array Problem 1m 13s ✓
I Infinitely Long Game 1m 54s
J Journey of the Repetitor 1m 49s
K Kinda Ok Array Problem 1m 10s ✓
L Lasers 1m 39s
M Mirinae 2m 3s ✓
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114M - Mirinae

Each planet chooses exactly one other planet to “guard”. You can think of this as a directed graph where every node has exactly one outgoing edge, from node i to node A[i]. We want to select a set of planets S to place inside a protective barrier.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114L - Lasers

We are given a permutation of columns. A laser starts at each column at the top of a grid and travels downward through a sequence of rows.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114J - Journey of the Repetitor

We are given a directed grid where every cell contains exactly one instruction: move one step north, east, south, or west. The grid is not a finite board for movement, instead it is repeated infinitely in all directions, like a wallpaper.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114K - Kinda Ok Array Problem

We are given a single integer array and asked to consider every contiguous slice of it. For each slice, we compute the sum of its elements and check whether that sum is even.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114I - Infinitely Long Game

We are given an undirected graph with at most 12 vertices. Each edge can be independently oriented in one of three ways: left-to-right, right-to-left, or removed entirely.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114H - Hard Array Problem

We are given two integer sequences of the same length. From any contiguous segment of indices, we can compute two values: the sum of the chosen segment in the first array and the sum of the same segment in the second array.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114G - Gear Wheels

We are given a sequence of gear wheels arranged in a fixed left-to-right order, where each gear has a number of teeth. A valid chain is a subsequence of these gears, preserving original order, such that every adjacent pair can directly mesh.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114F - False Sanctum: Act 2

We are given a string $S$ of length $N$, and we want to extract a special “generator” string from it. This generator, called the key, is defined as the shortest possible substring that can reproduce the entire original string if we repeatedly place copies of it, allowing…
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114D - Don't be Perfect

We start from a fixed labeled tree on $N le 25$ vertices. This tree is not the object we are modifying freely, it is a mandatory backbone: every valid graph $G$ must contain all tree edges.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114E - Economic Inequality

Each bank starts with a fixed amount of money it must distribute, but it cannot give more than $K$ to any single stakeholder. Each stakeholder already has some initial wealth and also has an upper cap on how much total money they are allowed to end up with after all transfers.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114A - An Easy Array Problem

We are given a static array and multiple independent range queries. For each query, we look at a segment from index L to index R, with the guarantee that there are at least four elements inside it.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114C - Cake Cutting

We are given a circular cake centered at the origin, and each student makes exactly one straight cut. Every cut is a line segment whose endpoints lie on the circumference of the circle, so each cut behaves like a chord.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2024 ›

CF 105114B - Batch GCD

We are given a list of integers and need to determine whether there exists at least one pair of distinct elements whose greatest common divisor is greater than one.
codeforces competitive-programming Jun 27, 2026