Tishreen + SVU CPC 2023

#	Problem	Time	✓
A	CBS Bracket Sequence	50s	✓
B	GCN	1m	✓
C	United We Stand Divided We Fall	1m 59s
D	Similarity	41s	✓
E	Interesting Ratios	1m 8s	✓
F	Temporary Array	50s	✓
G	Charging Power	1m 58s
H	X Y ?	56s	✓
I	Link into the Vrains	52s	✓
J	Lazy Abdo	43s	✓
K	Finding The Way Home	54s	✓
L	Circles	1m 4s	✓
M	Captain Haddock And The Counting Problem	1m 57s
N	Fixing The Servers	57s	✓

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487M - Captain Haddock And The Counting Problem

Take Sample 1: Your output: This shows the algorithm is doing something like: - picking an element - sometimes flipping sign - accumulating a running sum or alternating heuristic This is essentially a local decision strategy, likely something like: “choose next element that…

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487N - Fixing The Servers

We are given several independent test cases. In each test case, there are n students. Each student has an integer value ai, and that value defines how compatible they are with others: the compatibility between two students x and y is the greatest common divisor of their values…

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487L - Circles

We are given several test cases, and each test case provides a set of distinct points on the integer grid. From these points, we are allowed to draw any circle in the plane. The circle is not constrained by radius or center, except that it must be a valid geometric circle.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487K - Finding The Way Home

We are given a tree rooted at node 1. Each node carries a fixed weight, and there is also a sequence of “day values” that is shared across all starting nodes.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487G - Charging Power

Take Sample 1: Your output: This shows the algorithm is doing something like: - picking an element - sometimes flipping sign - accumulating a running sum or alternating heuristic This is essentially a local decision strategy, likely something like: “choose next element that…

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487J - Lazy Abdo

We are given several independent scenarios. In each scenario, there is a list of tasks, and each task has a fixed duration in minutes. From these tasks, we must pick exactly k of them. Once chosen, their durations add up, and our goal is to make this total as large as possible.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487I - Link into the Vrains

We are given a set of monsters placed on a number line. Each monster has a position and a power value, which can be positive or negative. The total damage we deal is simply the sum of the powers of all monsters we keep.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487H - X Y ?

We are given a prime modulus $p$, together with two exponents $a$ and $b$ that are coprime, and two values $x$ and $y$. There is a hidden consistency condition: if we raise $x$ to the power $a$ and $y$ to the power $b$, those results are equal modulo $p$.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487F - Temporary Array

We are given a line of elements with positive values. Time moves in discrete steps. At each second, only the two ends of the current array are affected: the leftmost element and the rightmost element both decrease by one.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487E - Interesting Ratios

Each test case describes a download process that completes in exactly n equal steps, from 0 to n. At some intermediate point x, where 1 ≤ x ≤ n - 1, the download is at x/n completion and (n - x)/n remaining.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487C - United We Stand Divided We Fall

Take Sample 1: Your output: This shows the algorithm is doing something like: - picking an element - sometimes flipping sign - accumulating a running sum or alternating heuristic This is essentially a local decision strategy, likely something like: “choose next element that…

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487D - Similarity

We are given several strings, all having the same fixed length. We are allowed to construct one new string of that same length. The goal is to choose this constructed string so that it matches the given strings as much as possible in total.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487B - GCN

We are given a tree, so every pair of nodes has exactly one simple path between them. For any two nodes $a$ and $b$, we define the set $h{a,b}$ as the collection of all nodes lying on the unique path between $a$ and $b$, including endpoints.

Practice › Codeforces Solutions › Tishreen + SVU CPC 2023 ›

CF 104487A - CBS Bracket Sequence

We are given a bracket string consisting only of opening and closing parentheses. We are allowed to repeatedly modify the string using an operation that does not replace characters inside the string, but instead grows it in a very specific way: in one move we attach exactly…