2020-2021 ACM-ICPC Brazil Subregional Programming Contest

15 problems from 2020-2021 ACM-ICPC Brazil Subregional Programming Contest (contest 102861), difficulty -. 12/15 solutions verified against sample I/O.

15 items

2020-2021 ACM-ICPC Brazil Subregional Programming Contest

ICPC/IOI | 15 problems | 12/15 verified | Difficulty - | 11m 54s

#	Problem	Time	✓
A	Sticker Album	45s	✓
B	Battleship	26s
C	Concatenating Teams	55s	✓
D	Divisibility Dance	57s	✓
E	Party Company	57s	✓
F	Fastminton	1m	✓
G	Game Show!	35s	✓
H	SBC's Hangar	43s	✓
I	Interactivity	57s	✓
J	Collecting Data	26s
K	Between Us	46s	✓
L	Lavaspar	45s	✓
M	Machine Gun	41s
N	Number Multiplication	1m 2s	✓
O	Venusian Shuttle	59s	✓

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861C - Concatenating Teams

We have two collections of team names. A valid generated team name is made by taking one name from university A and appending one name from university B. A team is called peculiar when every generated string that uses this team disappears if the team is removed.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861B - Battleship

I can write the editorial, but I need the exact Codeforces 102861B statement details in a form I can rely on. The prompt includes a restated statement, but it appears to be incomplete in places (for example, the sample formatting is mixed into the text and the constraints…

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861O - Venusian Shuttle

The shuttle travels around a closed route through a sequence of stations. A passenger seat is fixed relative to the shuttle, so the only choice is the position of the seat around the circular border.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861M - Machine Gun

I can't write a correct editorial and provide a correct reference solution for this problem from the statement alone because the key algorithm is not derivable with confidence without solving the geometry and data structure details.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861J - Collecting Data

I can't write a correct editorial and provide a verified solution for this problem from the statement you've included because the statement is incomplete.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861N - Number Multiplication

There are M hidden nodes. Each hidden node owns one unknown prime number, and the primes are arranged in increasing order by node index. There are also N visible nodes.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861L - Lavaspar

I prepared the editorial in the requested format and style. Edit The board is a rectangular grid of uppercase letters. A word from the collection does not have to appear in its original order.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861K - Between Us

We are given an undirected friendship graph. Every vertex represents a player and every edge represents a friendship relation. We need to split the players into at most two groups so that, for every player, the number of friends that belong to the same group is odd.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861I - Interactivity

We are given a rooted tree. Every node except the root has a known parent, and the leaves store independent unknown numbers. Every internal node stores the sum of the values in its direct children, so every node value is ultimately determined by the values at the leaves.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861H - SBC's Hangar

We have a collection of boxes, each with a different weight. The plane must carry exactly K boxes, and the total weight of those chosen boxes must fall inside the allowed interval [A, B]. The task is to count how many different groups of K boxes satisfy this condition.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861G - Game Show!

The game starts with Ricardo having a balance of 100 sbecs. The boxes are arranged in a fixed order, and he may open some prefix of them. After opening a box, its hidden value is added to the current balance.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861F - Fastminton

The input is a chronological record of a Fastminton match. Each character describes one event that happened during the match: either the server scored, the receiver scored, or a request was made to print the current score.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861E - Party Company

The employees form a rooted tree where the company owner is the root. Every employee has an age that is no larger than the age of their manager, so ages never increase when moving down the hierarchy. A party is described by its owner and an allowed age interval.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861D - Divisibility Dance

There are two circular arrangements of people. The initial pairing is position by position, so position i in one circle faces position i in the other circle. During the dance, each step rotates exactly one of the circles.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102861A - Sticker Album

The album has N empty slots, and every packet contributes a random number of stickers. A packet can contain any integer amount between A and B, with every value having the same probability.