The 13th Shandong ICPC Provincial Collegiate Programming Contest
13 problems from The 13th Shandong ICPC Provincial Collegiate Programming Contest (contest 104417), difficulty -. 13/13 solutions verified against sample I/O.
The 13th Shandong ICPC Provincial Collegiate Programming Contest
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 33s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Orders | 49s | ✓ | |||
| B | Building Company | 1m 3s | ✓ | |||
| C | Trie | 1m 29s | ✓ | |||
| D | Fast and Fat | 45s | ✓ | |||
| E | Math Problem | 1m 3s | ✓ | |||
| F | Colorful Segments | 51s | ✓ | |||
| G | Matching | 53s | ✓ | |||
| H | Be Careful 2 | 49s | ✓ | |||
| I | Three Dice | 1m 2s | ✓ | |||
| J | Not Another Path Query Problem | 53s | ✓ | |||
| K | Difficult Constructive Problem | 59s | ✓ | |||
| L | Puzzle: Sashigane | 51s | ✓ | |||
| M | Computational Geometry | 1m 6s | ✓ |
CF 104417M - Computational Geometry
We are given a convex polygon whose vertices are listed in counterclockwise order. From this polygon we must choose three distinct vertices $a, b, c$, also in counterclockwise order, with an additional structural constraint: when walking along the boundary from $b$ to $c$ in…
CF 104417L - Puzzle: Sashigane
We are given an n by n grid where exactly one cell is forbidden, and every other cell must be covered exactly once using L-shaped tiles.
CF 104417K - Difficult Constructive Problem
We are given a partially specified binary string where some positions are fixed as 0 or 1 and some are unknown. Each unknown position can be replaced independently by either 0 or 1.
CF 104417I - Three Dice
We are given three standard six-sided dice. Each face carries a number of pips from 1 to 6. Some faces are considered “red faces” and the rest “black faces”. Specifically, faces showing 1 and 4 are red, while faces showing 2, 3, 5, and 6 are black.
CF 104417J - Not Another Path Query Problem
We are given an undirected weighted graph. Each edge carries a 60-bit weight. For any walk between two vertices, we compute a single value by taking the bitwise AND of all edge weights along that walk. A walk is considered good if this AND value is at least a given threshold V.
CF 104417H - Be Careful 2
We are given a large axis-aligned rectangle from the origin to the point $(n, m)$. Inside this rectangle, there are a number of forbidden lattice points.
CF 104417G - Matching
We are given an array of integers, and we use it to define a graph on indices. Every index is a vertex, and we connect two vertices i and j when a specific arithmetic condition between their indices and values holds.
CF 104417F - Colorful Segments
We are given a collection of closed intervals on a number line. Each interval also has a binary label, red or blue. We want to count how many subsets of these intervals can be chosen such that no chosen red interval overlaps a chosen blue interval.
CF 104417E - Math Problem
We start with a single integer and are allowed to transform it using two reversible-looking digit operations in base $k$. One operation appends a digit in base $k$, meaning we multiply the number by $k$ and add a chosen remainder less than $k$.
CF 104417D - Fast and Fat
Each test case describes a team of people, where every person has a running speed and a weight. The team is allowed to form pairs where one person carries exactly one other person on their back, and a person can either be carrying someone, being carried, or doing nothing.
CF 104417C - Trie
We are given a rooted tree with nodes labeled from 0 to n, where 0 is the root. Each edge currently has no label, but every node has at most 26 children, so in principle we can assign lowercase letters to outgoing edges from any node without conflict.
CF 104417B - Building Company
We are given a company that starts with some employees of different occupations, where each occupation type has a current number of available workers. On top of this initial workforce, there are multiple building projects available.
CF 104417A - Orders
Each order in this problem arrives with a deadline day and a required quantity of products. The factory produces a fixed number of products every day starting from day one, and there is no initial inventory.