Teamscode Summer 2023 Contest

19 problems from Teamscode Summer 2023 Contest (contest 104520), difficulty -. 7/19 solutions verified against sample I/O.

19 items

Teamscode Summer 2023 Contest

Special | 19 problems | 7/19 verified | Difficulty - | 32m 38s

#	Problem	Time	✓
A	Who is cooking?	1m 1s	✓
B	Restaurant Sorting	1m 54s	✓
C	Largest Palindromic Subsequence	2m 23s
D	Yet Another Math Query Problem	1m 15s	✓
E	Evil problemsetters	1m 23s
F	Maximum Trust	1m 14s	✓
G	Maximum Xor	1m 48s
H	Permutator	1m 4s	✓
I	Counting Palindromic Sequences	1m 35s
J	TeamsCode Meetings	1m 46s
K	Med and Mex	1m 35s
L	Easy Tree Problem	2m 15s
M	Gift Wrapping	1m 45s
N	Save the Timeline!	2m 28s
O	Average Range Query Problem	1m 54s
P	Omer and Intervals	1m 14s	✓
Q	Beautiful Matrix Counting	1m 34s
R	Oil Fields	2m 11s
S	Farming Negative Karma	2m 19s	✓

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520S - Farming Negative Karma

We are given a rectangular farm grid and a sequence of operations that affect it over time. The first type of operation repeatedly tills subrectangles, increasing a counter on every cell inside the chosen region.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520R - Oil Fields

We are given a set of points on the plane, each point carrying a positive value interpreted as an amount of oil. Alice may choose some subset of these points and draw a closed boundary around them.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520Q - Beautiful Matrix Counting

We are working with a binary matrix of size $2 times n$, meaning there are two rows and $n$ columns, and every cell contains either 0 or 1.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520O - Average Range Query Problem

We are given several independent random experiments, each described by an interval. For each interval $[li, ri]$, one real number is sampled uniformly at random. We repeat this for all testers, so we end up with a set of $n$ independent random values.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520P - Omer and Intervals

We are given several test cases, and each test case consists of a collection of closed intervals on a number line. Every interval must be assigned to exactly one of two groups.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520N - Save the Timeline!

This failure is much simpler than it looks: the program is now crashing at the very first line. That means the submitted code uses: but never imported sys in that version of the script.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520M - Gift Wrapping

We are given a sequence of axis-aligned rectangles. Each rectangle represents a gift, and it is already sorted by its right boundary in non-decreasing order.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520L - Easy Tree Problem

We are given a rooted tree where every node starts with an initial color and must end with a target color. The only operation allowed is to choose a node and paint its entire subtree with a single chosen color.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520J - TeamsCode Meetings

We are given a cyclic schedule with $N$ days, where meetings happen on some subset of days in every cycle. Each of the $M$ problem setters has a fixed weekly pattern: setter $i$ attends meetings on $pi$ specific days of the cycle. Now imagine an idea appears on some day $d$.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520K - Med and Mex

We are working with permutations of the numbers from 1 to n, but the actual object of interest is not the permutation itself, rather all of its contiguous subarrays, and how they behave under two statistics computed on the values inside them.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520I - Counting Palindromic Sequences

We are counting structured compositions of an integer $n$, but with two extra constraints layered on top. Each valid object is a sequence of positive integers whose sum is exactly $n$, and the sequence must read the same forwards and backwards.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520H - Permutator

We are given two arrays of the same length. One array, call it a, is fixed in position. The second array, b, can be permuted arbitrarily.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520G - Maximum Xor

Each query gives three numbers $x$, $y$, and $z$. We are allowed to choose an integer $v$ in the range $0 le v < z$. For that chosen $v$, we evaluate two shifted values $x+v$ and $y+v$, take their bitwise XOR, and want the maximum possible value over all valid $v$.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520F - Maximum Trust

We are processing a sequence of values in a fixed order. A score starts at zero, and for each value in the sequence we must immediately decide whether to add it to the current score or multiply the current score by it.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520E - Evil problemsetters

We are given a hidden positive integer $x$, and we are allowed to ask questions about it in the form of clues. Each clue chooses two integers $a$ and $b$, and we are told whether the absolute difference $ The goal is not to compute $x$ by interactive querying, but to design a…

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520C - Largest Palindromic Subsequence

We are given a string over lowercase English letters and we are allowed to delete characters in any positions while keeping the remaining characters in order. Among all possible subsequences that form a palindrome, we need to pick the one that is lexicographically largest.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520D - Yet Another Math Query Problem

Each query describes a range of integers from l to r, and asks how many ordered pairs (a, b) inside that range satisfy a specific condition involving a function f(a, b). The function itself simplifies before we even start counting pairs.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520B - Restaurant Sorting

We are given a stack of distinct integers, where the first element is the bottom and the last element is the top.

Practice › Codeforces Solutions › Teamscode Summer 2023 Contest ›

CF 104520A - Who is cooking?

The task is deliberately minimal: the judge gives us a single integer input, but the actual computation is not derived from that value in any meaningful way. Instead, the problem is essentially asking us to output a fixed name from a known set of nine possible strings.