SanSi Cup 2023

7 problems from SanSi Cup 2023 (contest 105228), difficulty -. 1/7 solutions verified against sample I/O.

7 items

SanSi Cup 2023

Special | 7 problems | 1/7 verified | Difficulty - | 21m 37s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Game				1m 54s
B	Randy Ranges				5m
C	Suffixes				5m 12s
D	Frogo				1m 28s
E	Building Pigeon Houses				1m 17s	✓
F	The Game Club				1m 27s
G	The Mystery of the Sacred Triangle				5m 19s

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228G - The Mystery of the Sacred Triangle

We are given multiple independent queries. Each query describes a triangle in the plane using three points. A vertical light source shines from above, and every point of the triangle casts a vertical projection downwards onto the ground.

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228F - The Game Club

We are looking at a sequential game played by people sitting in a circle. Each player has a fixed “favorite number”. A single die with faces from 1 to m is rolled repeatedly, but the rolls are not globally shared.

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228C - Suffixes

We are given a fixed set of dictionary words, each very short, and then a large number of queries. Each query provides a word and a rank. For a query word, we compare it against every dictionary word using suffix matching.

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228B - Randy Ranges

We are given an array where each element is a large integer up to 10^18, and we need to support two operations. One operation updates a single position in the array.

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228E - Building Pigeon Houses

We are given a collection of pigeon species, where each species has a limited supply of pigeons available for purchase. The goal is to build as many identical pigeon houses as possible.

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228D - Frogo

We are given several independent scenarios. In each scenario there are $n$ steps, each with a height value, and a frog that moves from the leftmost step to the rightmost step. The frog can rearrange the steps in any order before starting its journey.

Practice › Codeforces Solutions › SanSi Cup 2023 ›

CF 105228A - The Game

Two players stand on a tree, initially anchored at node 1. They take turns moving a token along edges, always stepping to a neighbor of the current node. Once a node has been visited, it is removed from consideration, so the token can never return to it.