National Yang Ming Chiao Tung University 2025 Team Selection Programming Contest
13 problems from National Yang Ming Chiao Tung University 2025 Team Selection Programming Contest (contest 106059), difficulty -. 13/13 solutions verified against sample I/O.
National Yang Ming Chiao Tung University 2025 Team Selection Programming Contest
Special | 13 problems | 13/13 verified | Difficulty - | 12m 18s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Angle Problem | 52s | ✓ | |||
| B | Binary Palindromes | 1m 11s | ✓ | |||
| C | Chess Pieces | 1m 13s | ✓ | |||
| D | Data Transmission | 58s | ✓ | |||
| E | Echoes on the Endless Line | 54s | ✓ | |||
| F | Forbidden Spell Sequence | 50s | ✓ | |||
| G | Graph Orientation | 1m 3s | ✓ | |||
| H | Huge Subsets | 56s | ✓ | |||
| I | Ice Sliding | 56s | ✓ | |||
| J | Jigsaw of Perfect Squares | 57s | ✓ | |||
| K | Karl's Dormitory Allocation | 46s | ✓ | |||
| L | Lantern Festival | 46s | ✓ | |||
| M | Median Replacement | 56s | ✓ |
CF 106059G - Graph Orientation
We are given a connected bipartite graph with up to 100 vertices, where each vertex has a positive weight. The task is not just to assign directions arbitrarily to edges, but to orient every edge so that a particular cost function becomes as small as possible.
CF 106059L - Lantern Festival
The problem is essentially asking us to process a row of lanterns along a riverbank, where each lantern is either on or off. The input gives us a sequence of length n, and each position contains either a 0 meaning the lantern is unlit or a 1 meaning it is glowing.
CF 106059J - Jigsaw of Perfect Squares
We are given a multiset of integers and we are allowed to permute them freely. After choosing an order, each value is placed into a position indexed from 1 to n.
CF 106059K - Karl's Dormitory Allocation
We are given a list of numerical valuations, one per student, representing how much each student values a dormitory spot. Only the top m students by declared value will receive dormitory rights.
CF 106059C - Chess Pieces
We are given three labeled points in the plane, and each point can be moved repeatedly. A single move picks one of the points and relocates it anywhere in the plane, but under a strict geometric constraint: the angle formed at the moved point by the segments to the other two…
CF 106059E - Echoes on the Endless Line
We are given positions of enemies and positions of observers on a number line. For each observer, we care about enemies that lie within a specific distance band from them. Each observer at position b defines two radii.
CF 106059D - Data Transmission
We are given a tree, meaning there is exactly one simple path between any two nodes. Each query gives us two independent communication requests: one from a to b and another from c to d. Activating a node means that node lies on at least one of the two chosen paths.
CF 106059M - Median Replacement
We are given an array, and we repeatedly apply a randomized operation on it. One step of the process picks an index uniformly at random and overwrites that position with the median of the remaining elements.
CF 106059H - Huge Subsets
We are given an array of positive integers. For each $k$, we look at all ways to choose exactly $k$ elements and record the sum of each such choice. This produces a multiset $Sk$, where repetition matters because different subsets can produce the same sum.
CF 106059B - Binary Palindromes
We are given a binary string $s$. We are allowed to cut it into a sequence of contiguous pieces, and the cut points are completely flexible, meaning every split of the form “choose $k$ and break into $k$ substrings” is valid, and all such splits are counted.
CF 106059I - Ice Sliding
The grid can be seen as a board of ice tiles and walls. From any starting ice cell, a move consists of choosing an initial direction and then continuously sliding in that direction until an obstacle stops the motion.
CF 106059F - Forbidden Spell Sequence
We are building strings of length $n$ using a fixed alphabet of exactly seven symbols, from $a$ to $g$. Every position in the string is chosen independently from this alphabet, but not every resulting string is allowed. The restriction comes from a set of forbidden rules.
CF 106059A - Angle Problem
We are given a fixed list of points on a plane, stored in order, and we are asked to answer many independent queries. Each query selects a contiguous segment of these points and also gives a viewpoint located strictly above all points.