Codeforces Round 1028 (Div. 2)

Solutions for Codeforces Round 1028 (Div. 2) (contest 2116). 1/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 1028 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2900 | Time: 13m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Gellyfish and Tricolor Pansy	800	games, greedy	1m 56s	✗
B	Gellyfish and Baby's Breath	1300	greedy, math, sortings	2m 45s	✗
C	Gellyfish and Flaming Peony	1500	brute-force, dfs-and-similar, dp	2m 3s	✓
D	Gellyfish and Camellia Japonica	2100	constructive-algorithms, dfs-and-similar, graphs	1m 45s	✗
E	Gellyfish and Eternal Violet	2700	combinatorics, dp, greedy	3m 22s	✗
F	Gellyfish and Forget-Me-Not	2900	bitmasks, greedy, math	1m 30s	✗

Practice › Codeforces Solutions › Codeforces Round 1028 (Div. 2) ›

CF 2116E - Gellyfish and Eternal Violet

The problem can be reframed as follows. Gellyfish faces a group of n monsters, each with a given HP hi. She wants to reduce every monster's HP to exactly 1. She has m rounds of attacks, and in each round a special sword may “shine” with probability p.

Practice › Codeforces Solutions › Codeforces Round 1028 (Div. 2) ›

CF 2116F - Gellyfish and Forget-Me-Not

In this problem, we have a sequential two-player game with a numeric twist. Each round has a pair of numbers, one from array a and one from array b. There is also a binary string c that decides whose turn it is.

Practice › Codeforces Solutions › Codeforces Round 1028 (Div. 2) ›

CF 2116D - Gellyfish and Camellia Japonica

We are given a length-n array that evolves under q operations. Each operation takes two indices x and y, computes the smaller of their current values, and writes that value into a third position z.

Practice › Codeforces Solutions › Codeforces Round 1028 (Div. 2) ›

CF 2116B - Gellyfish and Baby's Breath

We are given two permutations p and q of the numbers 0...n-1. For every position i, we must evaluate all pairs of indices (j, i-j) such that 0 ≤ j ≤ i, and compute $$2^{pj}+2^{q{i-j}}$$ Among all these candidates, we take the maximum and store it in r[i].

Practice › Codeforces Solutions › Codeforces Round 1028 (Div. 2) ›

CF 2116C - Gellyfish and Flaming Peony

We are given an array of positive integers. In one operation, we choose two different positions and replace one value with the gcd of the two values. The process may be repeated as many times as needed.

Practice › Codeforces Solutions › Codeforces Round 1028 (Div. 2) ›

CF 2116A - Gellyfish and Tricolor Pansy

We are asked to predict the winner of a turn-based duel between two players, Gellyfish and Flower. Each player has a main character and a knight, each with its own health points (HP). Gellyfish has a HP, Flower has b HP, Gellyfish's knight has c HP, and Flower's knight has d HP.