2022 ICPC Asia-Manila Regional Contest

12 problems from 2022 ICPC Asia-Manila Regional Contest (contest 104118), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2022 ICPC Asia-Manila Regional Contest

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 10m 47s

#	Problem	Time	✓
A	An Easy Calculus Problem	43s	✓
B	Better than Bitcoin	1m 2s	✓
C	Conform Conforme	52s	✓
D	Domination Devil	1m 15s	✓
E	Escape from Markov	52s	✓
F	Factions vs The Hegemon	49s	✓
G	Gallivanting Merchant	48s	✓
H	HIIT	1m 4s	✓
I	Item Crafting	1m 2s	✓
J	Junior Steiner Three	49s	✓
K	Kapitan Amazing	44s	✓
L	LCG Manipulation	47s	✓

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118L - LCG Manipulation

We are given a deterministic sequence generated by a linear recurrence under a modulus. Starting from an initial value s, every next value is produced by multiplying the previous value by a, adding b, and then reducing modulo a large prime p.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118K - Kapitan Amazing

We are given a simplified description of a keyboard where each key corresponds to an uppercase letter arranged in three rows. Some of these keys are marked with an asterisk, meaning they are “oily”, and every other key is clean.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118I - Item Crafting

We are given a large set of items arranged in a strict dependency system. Some items are basic resources that already exist in limited quantities, while all other items are produced by recipes that consume previously defined items.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118J - Junior Steiner Three

We are given a rectangular grid where each cell is either land or water. Exactly three cells are already land, and we are allowed to convert any number of water cells into land.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118H - HIIT

We are given a sequence of exercises. For each exercise, Bob has three possible choices: skip it, do an easy version, or do an intense version. Each choice has an energy cost of 0, $ai$, or $bi$ respectively, with $ai < bi$.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118D - Domination Devil

We start with a complete undirected graph on $n$ vertices, where vertex labels represent a strict ordering of “power”. Every pair of vertices is initially connected by a single edge.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118G - Gallivanting Merchant

We are given a fixed step size $k$. We are also given $n$ time intervals, each interval representing a range of days during which a particular item is being sold. The merchant appears periodically depending on our choice of a starting day $s$.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118F - Factions vs The Hegemon

We are given a line of n factions, each sitting in a fixed west-to-east order and each carrying a wealth value. Over time, factions disappear one by one until only a single faction remains.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118E - Escape from Markov

We are given a weighted graph where cities are nodes and roads are undirected edges, each taking exactly one hour to traverse. From a starting city, we want the minimum time to reach a destination city. The complication is that there are patrol cars moving on fixed cyclic routes.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118B - Better than Bitcoin

We are given the first $n$ prime numbers and we must split them into two groups: one for Alice and one for Bob. Each prime is indivisible and must go entirely to exactly one of them.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118C - Conform Conforme

We are given an array of integers representing values written on students’ shirts. Each day, every position updates its value simultaneously based on a global statistic: a value v becomes the number of occurrences of v in the entire array on that day.

Practice › Codeforces Solutions › 2022 ICPC Asia-Manila Regional Contest ›

CF 104118A - An Easy Calculus Problem

We are given a function $f(x)$ defined on real numbers, but split into three regions of $x$. Each region uses a different formula: a linear expression on the far left, another linear expression in the middle, and a cubic polynomial on the right.