Codeforces Round 467 (Div. 1)

2 problems from Codeforces Round 467 (Div. 1) (contest 936), difficulty 2100-2300. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 467 (Div. 1)

Div. 1 | 2 problems | 0/2 verified | Difficulty 2100-2300 | 4m 52s

# Problem Rating Tags Accepted Time ✓
B Sleepy Game 2100 dfs-and-similar, dp, games 3,411 1m 40s
C Lock Puzzle 2300 constructive-algorithms, implementation, strings 1,259 3m 12s
Practice › Codeforces Solutions › Codeforces Round 467 (Div. 1) ›

CF 936C - Lock Puzzle

We are given a string of length $n$, and we are allowed to transform it using a single operation that cuts the string into a suffix and a prefix. The suffix is reversed and moved to the front, and the prefix is appended after it.
codeforces competitive-programming constructive-algorithms implementation strings Jun 17, 2026
Practice › Codeforces Solutions › Codeforces Round 467 (Div. 1) ›

CF 936B - Sleepy Game

We are given a directed graph where each vertex represents a state of a game token. A token starts at a fixed vertex, and two players alternate moving it along outgoing edges. A player loses immediately if they are to move from a vertex that has no outgoing edges.
codeforces competitive-programming dfs-and-similar dp games graphs Jun 17, 2026