2024 Xiangtan University Summer Camp-Div.1

6 problems from 2024 Xiangtan University Summer Camp-Div.1 (contest 105322), difficulty -. 5/6 solutions verified against sample I/O.

6 items

2024 Xiangtan University Summer Camp-Div.1

Special | 6 problems | 5/6 verified | Difficulty - | 10m 43s

# Problem Rating Tags Accepted Time ✓
A Coin 1m 14s ✓
B Game 5m 23s
C Genshin Impact 52s ✓
D Iwanna 1m 9s ✓
E League of Legends 50s ✓
F Tetris 1m 15s ✓
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.1 ›

CF 105322F - Tetris

We are given a rectangular grid where each cell is either free or blocked. The task is to place as many tetrominoes as possible on the free cells.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.1 ›

CF 105322A - Coin

We are tracking a single participant, Eric, who starts at a fixed position among $n$ people ordered by rank. Each round pairs people into disjoint matches.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.1 ›

CF 105322B - Game

Codeforces 105322B: Game
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.1 ›

CF 105322D - Iwanna

We are given a tree where each edge has a positive weight. For every query, we pick a start node s and a target node t, and we simulate a random walk with a very specific memory rule until we reach t. The process always starts at s.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.1 ›

CF 105322E - League of Legends

We are looking at a very simplified combat process between two entities with health values. Eric starts with n health points and Clamee starts with m health points.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.1 ›

CF 105322C - Genshin Impact

We are given a lowercase string $S$. From this string, Eric defines a family of “forbidden words” in a slightly unusual way: take the multiset of characters in $S$, form any permutation of it, and then take any subsequence of that permutation.
codeforces competitive-programming Jun 22, 2026