JPC 1.0

12 problems from JPC 1.0 (contest 105317), difficulty -. 12/12 solutions verified against sample I/O.

12 items

JPC 1.0

Special | 12 problems | 12/12 verified | Difficulty - | 11m 16s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Juan and Alfino				56s	✓
B	Paulo's Plan				1m	✓
C	K Flips				58s	✓
D	Eduardo Looking for Juan (Easy Version)				1m 3s	✓
E	Eduardo Looking for Juan (Hard Version)				1m	✓
F	Maze Runner				57s	✓
G	Carlo's Password				53s	✓
H	Juan vs. Man				51s	✓
I	Split the Stri ng				1m 3s	✓
J	JSUM				52s	✓
K	P\u00e8ppito.				1m 1s	✓
L	Minimum Enclosing Rectangle				42s	✓

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317L - Minimum Enclosing Rectangle

We are given a collection of points on a 2D plane, and we want to enclose all of them inside a rectangle whose sides are aligned with the coordinate axes. Among all such axis-aligned rectangles, we are asked to find the one with the smallest possible area.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317K - Pèppito.

We are given a tree with a value written on every node. Each query picks two nodes, defining a unique simple path between them. Along that path we look at the sequence of node values and count how many times each value appears.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317I - Split the Stri ng

We are given a single string and we are allowed to choose exactly one cut position that splits it into a left part and a right part. For each cut, we look at the two resulting strings and ask whether each one can be rearranged into a palindrome.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317J - JSUM

We are given a static array of integers, and we are asked to look at every contiguous subarray. For each subarray, we compute the greatest common divisor of all elements inside it, and then we sum all of those gcd values across all subarrays.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317E - Eduardo Looking for Juan (Hard Version)

We are given a tree with $n$ nodes, where each node has a small integer value $ai$. Each query selects two nodes $u$ and $v$, and we consider the unique simple path between them.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317H - Juan vs. Man

We are asked to construct an array of length $n$, where every element lies between $1$ and $m$, with a global restriction on its subarrays.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317G - Carlo's Password

Each input string in the list can be thought of as a very short sequence of characters, at most length six. For every query string, we are asked whether it can be formed by deleting some characters from at least one of these stored strings without changing the order of the…

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317D - Eduardo Looking for Juan (Easy Version)

We are given a tree with up to a very large number of nodes, where each node has a small integer value between 1 and 70. Each query gives two nodes, and we look at the unique simple path between them. Along this path, we multiply all node values together.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317C - K Flips

We are working with a binary string that represents a line of tables, where each position is either flipped or not flipped. The string changes only through direct point updates: a query of type 1 toggles a single position from 0 to 1 or from 1 to 0.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317A - Juan and Alfino

We are given two integers. One represents the cost of a single sandwich, and the other represents how much money Juan has available. Juan wants to spend his money only on full sandwiches and give them to friends, where each friend receives exactly one sandwich.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317F - Maze Runner

We are given a very small grid, at most 10 by 10, where every cell contains a lowercase letter. From any cell we are allowed to move to any of its 8 neighbors, including diagonals, and we are allowed to revisit cells arbitrarily many times.

Practice › Codeforces Solutions › JPC 1.0 ›

CF 105317B - Paulo's Plan

We are given a very small set of distinct characters in a string $T$, and a much larger string $S$ that contains exactly the same multiset of characters as $T$, just in repeated quantities. We are allowed to permute both strings freely.