Technocup 2020 - Elimination Round 1

7 problems from Technocup 2020 - Elimination Round 1 (contest 1223), difficulty 800-3200. 6/7 solutions verified against sample I/O.

7 items

Technocup 2020 - Elimination Round 1

Special | 7 problems | 6/7 verified | Difficulty 800-3200 | 27m 26s

# Problem Rating Tags Accepted Time ✓
A CME 800 math 22,285 5m 7s ✓
B Strings Equalization 1000 strings 15,893 5m 14s ✓
C Save the Nature 1600 binary-search, greedy 9,761 1m 52s ✓
D Sequence Sorting 2000 dp, greedy, two-pointers 4,467 4m 23s ✓
E Paint the Tree 2100 dp, sortings, trees 2,891 5m 17s ✓
F Stack Exterminable Arrays 2600 data-structures, divide-and-conquer, dp 2,268 2m 53s ✓
G Wooden Raft 3200 binary-search, math, number-theory 276 2m 40s
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223F - Stack Exterminable Arrays

We are given an array and a peculiar cancellation process that behaves like a stack with annihilation. We scan the array from left to right, maintaining a stack. When we see a value, if the stack top is different, we push it.
codeforces competitive-programming data-structures divide-and-conquer dp hashing Jun 15, 2026
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223G - Wooden Raft

We are given a collection of logs, each with an integer length. From these logs we are allowed to cut pieces, but we are not allowed to glue pieces together. The goal is to assemble a rectangular raft structure that requires two kinds of side lengths, call them x and y.
codeforces competitive-programming binary-search math number-theory Jun 15, 2026
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223E - Paint the Tree

We are given a tree where every edge has a weight. The task is to assign colors to vertices under a very specific rule: each vertex receives exactly $k$ colors, and any particular color can appear at most twice across the entire tree.
codeforces competitive-programming dp sortings trees Jun 15, 2026
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223B - Strings Equalization

Each query gives two strings of the same length. You are allowed to repeatedly apply an operation on either string: pick two neighboring characters and overwrite one with the other.
codeforces competitive-programming strings Jun 15, 2026
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223A - CME

We are given a number of matches and we want to arrange them into a valid arithmetic equation of the form “a + b = c”, where each number is strictly positive.
codeforces competitive-programming math Jun 15, 2026
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223D - Sequence Sorting

We are given multiple independent sequences, and for each one we want to transform it into a non-decreasing array using a very specific operation.
codeforces competitive-programming dp greedy two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Technocup 2020 - Elimination Round 1 ›

CF 1223C - Save the Nature

We have a collection of ticket prices, and we are free to choose the order in which tickets are sold. Two donation programs exist. Every a-th sold ticket contributes x% of its price, and every b-th sold ticket contributes y% of its price.
codeforces competitive-programming binary-search greedy Jun 11, 2026