2024 Argentinian Programming Tournament (TAP)

14 problems from 2024 Argentinian Programming Tournament (TAP) (contest 105321), difficulty -. 13/14 solutions verified against sample I/O.

14 items

2024 Argentinian Programming Tournament (TAP)

Special | 14 problems | 13/14 verified | Difficulty - | 17m 19s

#	Problem	Time	✓
A	Advanced tic-tac-toe	1m 11s	✓
B	Period Search	1m	✓
C	Discovering Ngipto	58s	✓
D	Duo	53s	✓
E	Final Showdown	56s	✓
F	Fixture	43s	✓
G	Garlands	56s	✓
H	Electric Fence for Livestock	53s	✓
I	Innovations in Robotics	1m 10s	✓
J	Never Add Up to X	5m 20s
K	Typographic Kaleidoscope	49s	✓
L	Games	57s	✓
M	Balloon Market	48s	✓
N	New Dimensions	45s	✓

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321G - Garlands

We are given a single string consisting of uppercase letters, and we want to form as many disjoint groups of exactly three letters as possible. Each valid group must be rearranged into either the word “TAP” or the word “TUP”.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321N - New Dimensions

We are given a list of possible positive integer lengths. From this list, we must choose three values, allowing repetition, and interpret them as the three dimensions of a hollow rectangular box.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321A - Advanced tic-tac-toe

The game is played on a fixed 3×3 grid, but instead of thinking about it as a board, it is easier to treat it as nine indexed positions from 1 to 9. Two players alternate turns, X going first and O second, placing their symbol into an empty cell.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321D - Duo

Three players participate in a simple alliance game where exactly two of them form a team and the remaining player competes alone. Each player has a fixed integer score.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321L - Games

We are given an array of integers and many queries, each query focuses on a contiguous segment of that array. For each segment, two players play a turn-based game where they can either pick an unused element from that segment or pass their turn.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321E - Final Showdown

We are given a hero who starts with a fixed amount of power points. There are N weapons, and each weapon can be used at most once. Every weapon has three parameters A, B, and C.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321J - Never Add Up to X

Codeforces 105321J: Never Add Up to X

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321I - Innovations in Robotics

We are given a grid with up to 1000 rows and 1000 columns. Each cell is either dry or wet. The robot must traverse the grid in a very constrained geometric way: it moves only in straight axis-aligned segments, and it can only change direction when it is currently on a dry cell.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321C - Discovering Ngipto

We are working in a 2D desert plane that contains a simple polygon representing the footprint of a pyramid base, and a single point above the plane representing the sun.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321M - Balloon Market

We are given a sequence of layovers along a trip. At the start, Pedro owns up to K balloons, and he carries them through all layovers without ever replenishing inventory.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321K - Typographic Kaleidoscope

We are given a large grid of characters consisting only of and .. Inside this grid, there is a hidden tiling: every belongs to exactly one rigid pattern, and each pattern is an unscaled copy of one of three fixed ASCII shapes representing the letters T, A, and P.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321H - Electric Fence for Livestock

We are given a plane containing axis-aligned rectangular fences. These rectangles are disjoint in the strong sense that their boundaries do not touch at all, so the plane is partitioned into regions separated by these rectangular obstacles.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321F - Fixture

We are given a chronological record of tennis matches played by a single player. Each match results in either a win or a loss, encoded as a binary array where 1 represents a win and 0 represents a loss. The scoring system has two independent components.

Practice › Codeforces Solutions › 2024 Argentinian Programming Tournament (TAP) ›

CF 105321B - Period Search

We are given a hidden string of length $N$, but we never get to see it directly. Instead, we can ask queries about substrings, and each query asks whether a chosen substring $t = s[L..R]$ is a valid period of the entire string.