The 20th Southeast University Programming Contest (Summer)

12 problems from The 20th Southeast University Programming Contest (Summer) (contest 105172), difficulty -. 5/12 solutions verified against sample I/O.

12 items

The 20th Southeast University Programming Contest (Summer)

Special | 12 problems | 5/12 verified | Difficulty - | 15m 27s

#	Problem	Time	✓
A	Nanami and Subtree of Tree	1m 41s
B	Nanami and Rectangles Putting Problem	1m 15s	✓
C	Nanami and the House Protecting Problem	1m 57s	✓
D	Nanami and the Constructive Problem	1m 26s	✓
E	Nanami and the Boy	25s
F	Nanami and Snowflakes	3m 3s
G	Nanami and the LLM Training Problem	42s
H	Nanami and the Block Puzzle	1m 36s
I	Nanami and the Golden Sunlight Sunflower Fields	36s
J	Divide the Sequence (easy version)	27s
K	Divide the Sequence (hard version)	1m 4s	✓
L	Nanami, Nanami, Nanami...	1m 15s	✓

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172L - Nanami, Nanami, Nanami...

We are given several independent test cases. In each test case, there is a list of integers. We are allowed to remove exactly one element from this list.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172F - Nanami and Snowflakes

The input describes several undirected graphs, and each graph is supposed to represent a “snowflake-like” structure. The task is to decide whether each graph matches a very rigid pattern. The structure we are looking for can be understood in two layers.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172K - Divide the Sequence (hard version)

We are given an integer array and we are allowed to cut it into exactly $k$ contiguous segments. Once the array is split, each segment is evaluated independently: inside a segment, we look at every subarray and count how many of those subarrays have sum exactly equal to a…

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172H - Nanami and the Block Puzzle

We are given a binary target pattern of length $n$, describing a 2×n grid where each column has two cells. A cell marked as 1 must be covered exactly once by placed tiles, while a cell marked as 0 must remain uncovered.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172J - Divide the Sequence (easy version)

We are given a sequence of integers and we must cut it into exactly $k$ consecutive pieces. Once the sequence is split, we look inside each piece and count how many subarrays inside that piece have sum exactly equal to a fixed value $x$.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172I - Nanami and the Golden Sunlight Sunflower Fields

We are given an $n times n$ grid where some cells are already occupied. Each occupied cell behaves like a node in a grid graph, and edges exist between orthogonally adjacent cells.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172G - Nanami and the LLM Training Problem

Codeforces 105172G: Nanami and the LLM Training Problem

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172D - Nanami and the Constructive Problem

We are given an array of values, but the array itself is not what we are optimizing over. Instead, we must decide which positions to “activate” or “color” by producing a binary string. Each position is either chosen or not chosen.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172E - Nanami and the Boy

Working

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172C - Nanami and the House Protecting Problem

We are given a grid where each cell is either empty, already blocked, or contains a house. Empty cells can potentially be turned into walls, and each such conversion has a given cost.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172A - Nanami and Subtree of Tree

We are given a tree with $n$ nodes. One node is chosen as a fixed “safe” node $m$. Two players alternate moves starting from the full tree. A move consists of choosing an edge, removing it, and discarding the entire component that does not contain node $m$.

Practice › Codeforces Solutions › The 20th Southeast University Programming Contest (Summer) ›

CF 105172B - Nanami and Rectangles Putting Problem

We are maintaining a large empty rectangular board of size $n times m$, initially uncovered. Over time, we receive operations that either place a smaller axis-aligned rectangle onto the board or remove a previously placed rectangle.