2019-2020 ACM-ICPC Brazil Subregional Programming Contest

13 problems from 2019-2020 ACM-ICPC Brazil Subregional Programming Contest (contest 102346), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2019-2020 ACM-ICPC Brazil Subregional Programming Contest

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 53m 38s

# Problem Rating Tags Accepted Time ✓
A Artwork 1m 18s ✓
B Buffoon 6m 23s ✓
C Crossings With Danger 3m 13s ✓
D Denouncing Mafia 1m 20s ✓
E Exhibition of Clownfish 5m 23s ✓
F Forests in Danger 1m 55s ✓
G Getting Confidence 1m 44s ✓
H Hour for a Run 1m 5s ✓
I Interplanetary 8m 7s ✓
J Jar of Water Game 11m 7s ✓
K Keep Calm and Sell Balloons 2m 14s ✓
L Less Coin Tosses 1m 30s ✓
M Maratona Brasileira de Popcorn 8m 19s ✓
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346E - Exhibition of Clownfish

We have (N) tanks. Tank (i) contains (Mi) male clownfish and (Fi) female clownfish. The condition (Mi=0) or (Fi0) means every tank that currently has males also has at least one female. During one night, exactly one fish may be moved from one tank to another.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346A - Artwork

The room is the rectangle with corners (0, 0) and (M, N). The thief needs a continuous path from the lower-left corner to the upper-right corner while staying strictly outside every sensor's detection disk.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346L - Less Coin Tosses

We have all binary strings of length (N), representing the possible results of (N) tosses of the same possibly biased coin. Carla and Daniel must assign every chosen string to at most one of them, while some strings may remain unused.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346K - Keep Calm and Sell Balloons

The street is a graph with two rows and (N) columns. Each house is a vertex. Two houses are connected when their positions differ by at most one row and at most one column, so horizontal, vertical, and diagonal moves are all allowed.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346G - Getting Confidence

We have an (N times N) matrix. Row (i) represents ornament (i), and column (j) represents shelf position (j). The value (a{i,j}) measures how confident Fulano is that ornament (i) originally occupied position (j).
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346F - Forests in Danger

We need to choose an integer distance (r) around every river so that the union of all preserved regions covers at least (P%) of the rectangular territory. Each river is an axis-aligned line segment.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346B - Buffoon

The election result is represented by an array of vote counts, where the first position belongs to Carlos and every later position belongs to a candidate who registered after him. The winner is the candidate with the largest number of votes.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346M - Maratona Brasileira de Popcorn

We have an array of N popcorn bags, where P[i] is the amount of popcorn in bag i. There are C competitors, and every competitor can eat at most T popcorn per second. The bags must be divided into contiguous segments.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346J - Jar of Water Game

We have a circle of at most 13 contestants. There are four copies of each card value being used, plus one wildcard. Each contestant starts with four ordinary cards, while the starting contestant also receives the wildcard and therefore initially has five cards.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346I - Interplanetary

We have an undirected weighted graph whose vertices are planets and whose edges are direct travel routes. Every planet has a temperature.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346H - Hour for a Run

The track contains N equally spaced signs, and Vinicius plans to run exactly V complete laps. Since one lap passes all N signs, the entire training consists of V N sign passages.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346D - Denouncing Mafia

The mafia hierarchy forms a rooted tree, with member 1 as the root. Every other member has exactly one direct superior, so every member has a unique path upward to the boss.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Brazil Subregional Programming Contest ›

CF 102346C - Crossings With Danger

We have an (N times M) rectangular grid of crossings. A vehicle starts at one crossing, chooses one of the four cardinal directions, and then moves at speed one crossing per second until it either leaves the grid or collides.
codeforces competitive-programming Aug 13, 2026