UFPE Starters Final Try-Outs 2020

11 problems from UFPE Starters Final Try-Outs 2020 (contest 102448), difficulty -. 11/11 solutions verified against sample I/O.

11 items

UFPE Starters Final Try-Outs 2020

Special | 11 problems | 11/11 verified | Difficulty - | 1h 32m

#	Problem	Time	✓
A	Accept or Reject	7m 16s	✓
B	Beza's Hangover	2m 52s	✓
C	Call from Mendes	2m 23s	✓
D	Drinking to turn red	9m 49s	✓
E	Everybody loves acai	8m 3s	✓
F	Finally, christmas!	5m 19s	✓
G	Gorggeous Peter's Great Friend	12m 22s	✓
H	Hellcife is on fire	10m 35s	✓
I	Ivan and the swimming pool	9m 57s	✓
J	Jingle Bells	8m 24s	✓
K	Kongey Donk	15m 26s	✓

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448C - Call from Mendes

We maintain a changing dictionary of words. An insertion assigns the word the index of that query, and a deletion refers back to that insertion index. For a type 3 query, we are given a string X and need to find an active dictionary word that starts with X.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448B - Beza's Hangover

The night can be viewed as an array of N positions. Position i stores the drink Beza consumed during the i-th hour. The bar provides M drink names, and each name has an associated alcohol volume. A type 1 query changes one array position to another drink.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448H - Hellcife is on fire

Think of each city as a vertex and each road as an undirected weighted edge. City (v) has an additional delay (Tv): once the fire reaches (v), the city does not become completely burnt immediately. It takes another (Tv) seconds. Initially, several cities are ignited at time (0).

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448I - Ivan and the swimming pool

We have an (N times M) grid. Each cell contains the maximum depth that can be excavated at that location before hitting rock. We must choose exactly (S) cells to form the pool. The chosen cells must be connected through shared sides, and the pool has one uniform depth.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448F - Finally, christmas!

Each building is an axis aligned rectangle standing on the same horizontal baseline. A building is described by its left coordinate (Li), right coordinate (Ri), and height (Hi), so it occupies the interval from (Li) to (Ri) and rises to height (Hi).

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448E - Everybody loves acai

Each restaurant gives Gabriel an integer (k), representing the maximum amount of açaí he can put into his bowl. He wants the largest positive integer not exceeding (k) whose proper divisors add up exactly to the number itself. If no such number exists, the answer is (-1).

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448K - Kongey Donk

Think of the trees as columns of a grid. There are n trees, numbered from left to right, and every tree has h banana positions, numbered from top to bottom. The input gives the banana count at every cell of this n × h grid. Kongey may start at the top of any tree.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448J - Jingle Bells

We have a tree with (N) vertices and (N-1) edges. Every edge either already has one of five colors, numbered (1) through (5), or is still uncolored and marked by (0). A final painting assigns a color to every uncolored edge while keeping all existing colors unchanged.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448G - Gorggeous Peter's Great Friend

We need to calculate the score of each candidate from a global stream of submissions. Peter has selected a set of problems, and every selected problem has a fixed score. A candidate earns that problem's score exactly when their submission to that problem receives the verdict AC.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448D - Drinking to turn red

We have a fixed point ((x,y)) where the magic ring is placed. Every ordinary ring has a center ((Xi,Yi)) and radius (Ri). The magic ring starts with some radius (r), and whenever it absorbs an ordinary ring, its radius grows by that ring's radius.

Practice › Codeforces Solutions › UFPE Starters Final Try-Outs 2020 ›

CF 102448A - Accept or Reject

We have a string S of length N, and we need to determine whether at least one contiguous substring of exactly M characters reads the same from left to right and from right to left.