RCPCamp 2023 Day 1

12 problems from RCPCamp 2023 Day 1 (contest 104822), difficulty -. 1/12 solutions verified against sample I/O.

12 items

RCPCamp 2023 Day 1

Special | 12 problems | 1/12 verified | Difficulty - | 18m 56s

# Problem Rating Tags Accepted Time ✓
A Yet Another Colored Tree Problem 1m 23s
B Coins 1m 37s
C Almost Tree Cut 1m 15s ✓
D Doping 2 1m 38s
E Anton Would Approve This Problem 1m 50s
F Difference In Skill 1m 31s
G Sign Flipping 1m 54s
H The Binary Matrix of All Time 1m 45s
I Weird Divisibility 1m 33s
J Triple Reverse Sort 1m 34s
K Distinctness Queries 1m 29s
L Best Or Worst 1m 27s
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822L - Best Or Worst

We are asked to count how many full permutations of the numbers from 1 to n can be completed from a partially known array, under a strong structural constraint. The constraint defines a valid permutation by a prefix rule.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822K - Distinctness Queries

We are given a grid of integers, and we must answer many queries that each describe a rectangular subregion. For every query, we need to decide whether all values inside that rectangle are pairwise different, meaning no number appears more than once inside the chosen submatrix.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822J - Triple Reverse Sort

We are given several independent test cases. Each test case provides a permutation of length n, and we are allowed to repeatedly apply a very specific local operation: choose any position i such that a block of three consecutive elements exists starting there, and reverse that…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822G - Sign Flipping

We are given a sequence of integers, and we are allowed to flip the sign of any individual element any number of times before doing anything else.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822H - The Binary Matrix of All Time

We are given a large grid with $n$ rows and $m$ columns, and each cell must contain either 0 or 1. The grid is considered valid if neither any row nor any column contains three identical values in a consecutive block.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822I - Weird Divisibility

We are given an integer $a$. For each test case, we must choose the smallest positive integer $b$ such that the number $a + b$ divides the product $a cdot b$ exactly.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822E - Anton Would Approve This Problem

We are given a binary string, and we are allowed to delete characters anywhere we like. After deletions, we look at the remaining sequence, and we want it to avoid a very specific kind of local disorder: no three consecutive positions (not necessarily adjacent in original…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822F - Difference In Skill

We are given a list of employees, each with a numeric skill value. For every employee, we want to know the largest possible team that includes them, under a restriction: within any chosen team, the difference between the maximum and minimum skill must not exceed a fixed…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822D - Doping 2

We are given a fixed permutation $p$ of size $n$, and we want to compare it against all other permutations of the same size that come lexicographically earlier than $p$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822B - Coins

We are given a pile of coins and two players who alternate turns. On a turn, a player starts with some number of coins, say $x$. They have two types of moves. They may always remove exactly one coin, leaving $x-1$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822A - Yet Another Colored Tree Problem

We are working with a tree where every node is assigned a color from the range $1$ to $k$. For each color $i$, we need to count how many simple paths in the tree contain at least one node whose color is $i$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › RCPCamp 2023 Day 1 ›

CF 104822C - Almost Tree Cut

We are given a connected undirected graph that has exactly one more edge than a tree with the same number of vertices. In other words, it is a tree plus one extra edge, so the structure contains exactly one cycle.
codeforces competitive-programming Jun 28, 2026