CSP-S 2023

4 problems from CSP-S 2023 (contest 104724), difficulty -. 2/4 solutions verified against sample I/O.

4 items

CSP-S 2023

Special | 4 problems | 2/4 verified | Difficulty - | 5m 41s

#	Problem	Time	✓
A	lock	1m 27s
B	game	1m 50s	✓
C	struct	1m 35s
D	tree	49s	✓

Practice › Codeforces Solutions › CSP-S 2023 ›

CF 104724D - tree

We are given a connected acyclic graph, so there is exactly one simple path between any two vertices. On this tree, we maintain a mutable condition on edges, initially uniform, and then process two types of operations.

Practice › Codeforces Solutions › CSP-S 2023 ›

CF 104724B - game

We are given a long string made of lowercase letters, and we are allowed to repeatedly delete any adjacent pair of equal characters. Each deletion removes exactly two neighboring identical letters and then the remaining parts of the string join together.

Practice › Codeforces Solutions › CSP-S 2023 ›

CF 104724C - struct

The task simulates a simplified C++-like memory model where we define struct types, create variables of those types, and then answer questions about how these variables are laid out in memory.

Practice › Codeforces Solutions › CSP-S 2023 ›

CF 104724A - lock

We are dealing with a circular lock made of five digits, each digit ranging from 0 to 9, where incrementing past 9 wraps back to 0.