ICPC-de-Tryst 2024

11 problems from ICPC-de-Tryst 2024 (contest 105064), difficulty -. 0/11 solutions verified against sample I/O.

11 items

ICPC-de-Tryst 2024

ICPC/IOI | 11 problems | 0/11 verified | Difficulty - | 15m 51s

#	Problem	Time
A	A Highly Constrained Problem...	1m 22s
B	SGPA Calculation	1m 51s
C	You and Assignments	1m 19s
D	Snakes Among Us	1m 25s
E	Color Conundrum	1m 23s
F	Armed Soldiers 2	1m 24s
G	Armed Soldiers 1	1m 17s
H	Tree Scoring	1m 25s
I	k-goodness	1m 31s
J	Non-Intersecting Arcs	1m 20s
K	ab ba count	1m 34s

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064B - SGPA Calculation

We are asked to construct any valid set of marks for Bob’s $n$ courses, each mark being an integer between 0 and 2047, with one extra constraint: the bitwise XOR of all marks must equal a given value $x$.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064A - A Highly Constrained Problem...

We are asked to construct a permutation of length $n$, meaning each integer from $1$ to $n$ appears exactly once, such that every position $i$ carries two independent constraints that describe how it participates in increasing subsequences.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064K - ab ba count

We are given a small alphabet, at most 7 letters, and a set of allowed swaps between ordered pairs of characters. Each swap rule says that whenever we see two positions in a string whose characters match one of these directed pairs, we are allowed to swap those positions.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064J - Non-Intersecting Arcs

We are counting how many permutations of numbers from 1 to n can be arranged so that when we connect consecutive elements with straight segments, those segments never cross in their interiors.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064I - k-goodness

We are given an integer array. From this array we define two special quantities that depend on how we restrict subarrays. The first quantity, call it $m0$, comes from looking only at subarrays that contain no negative numbers.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064H - Tree Scoring

We are given a sequence of values placed on the vertices of an unknown rooted tree. The root is fixed at vertex 1, and every other vertex must attach to a parent with a strictly smaller label.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064G - Armed Soldiers 1

We are given a set of soldiers placed on a number line. Each soldier has a fixed position and a weapon with a certain power. When a monster appears at some position, every soldier shoots toward that position.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064F - Armed Soldiers 2

Each soldier sits at an integer position on a number line and has a firing strength. A monster appears at some position and comes with a shield that weakens incoming bullets depending on how far they travel.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064E - Color Conundrum

We are working with a rooted tree where each vertex carries a color label. The root is fixed at vertex 1. On this tree, we must support two operations over time: recoloring a single vertex, and querying how many vertices of a given color exist inside a particular subtree.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064D - Snakes Among Us

We are dealing with a classroom of an odd number of students, each secretly holding a nonzero integer score. Exactly one student has the largest score, and that score is strictly greater than everyone else.

Practice › Codeforces Solutions › ICPC-de-Tryst 2024 ›

CF 105064C - You and Assignments

Each course has a number of assignments, and we are allowed to repeatedly transform the value in any single course using a special operation that depends on its index. The goal is to minimize the sum of all course values after applying these operations any number of times.