2020 ICPC Asia East Continent Final

13 problems from 2020 ICPC Asia East Continent Final (contest 103069), difficulty -. 11/13 solutions verified against sample I/O.

13 items

2020 ICPC Asia East Continent Final

ICPC/IOI | 13 problems | 11/13 verified | Difficulty - | 15m 48s

#	Problem	Time	✓
A	Namomo Subsequence	48s	✓
B	Rectangle Flip 2	2m 39s
C	Random Shuffle	50s	✓
D	City Brain	1m 5s	✓
E	Tube Master III	1m 17s	✓
F	Rooks	42s	✓
G	Prof. Pang's sequence	52s	✓
H	Prof. Pang Earning Aus	1m 4s	✓
I	Plants vs Zombies	2m 59s
J	Circle	59s	✓
K	Allin	46s	✓
L	Square	51s	✓
M	Fillomino	56s	✓

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069I - Plants vs Zombies

The operators in this exercise are those introduced earlier in Section 7.2.1.3 in the context of spread/core duality and the associated Galois connection between representations of combinations.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069M - Fillomino

We are given a toroidal grid of size (n times m), meaning the grid wraps around both horizontally and vertically. Each cell touches its four neighbors, and the top edge connects to the bottom edge while the left edge connects to the right edge.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069L - Square

We are given a sequence of integers and we are allowed to assign a strictly positive multiplier to every position.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069K - Allin

We are given a simplified heads-up Texas hold ’em situation with only two players and no folding. Each test case provides five cards: two private cards for Wolf Chicken and three shared community cards representing the flop.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069J - Circle

We are given a convex polygon described by its vertices in counterclockwise order. Think of this polygon as a rigid shape in the plane. We also fix a radius $r$. Now we imagine placing a circle of radius $r$ anywhere in the plane by choosing its center $p$.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069H - Prof. Pang Earning Aus

We are given a system with three interchangeable resources: Aus, balloons, and candies. At the start, Prof. Pang has exactly one Au and zero of the other two. There are two stores that allow conversions between these resources using fixed exchange rules.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069G - Prof. Pang's sequence

We are given a fixed array and many queries over contiguous segments of it. For each query interval $[l, r]$, we must count how many subarrays $[i, j]$ fully contained inside that interval have the property that the number of distinct values inside the subarray is odd.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069B - Rectangle Flip 2

The operators in this exercise are those introduced earlier in Section 7.2.1.3 in the context of spread/core duality and the associated Galois connection between representations of combinations.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069F - Rooks

We are given two sets of points on an infinite integer grid. One set belongs to Prof. Pang and the other belongs to Prof. Shou.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069E - Tube Master III

We are given a rectangular grid of crossings connected by horizontal and vertical tubes. At every crossing, we are allowed to either not use any tube or use exactly two tubes incident to that crossing.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069D - City Brain

We are given an undirected graph where every road initially takes one second to traverse. We are allowed to invest money into individual roads, and each dollar increases the “speed level” of that road by one. If a road has speed level $a$, traversing it takes $1/a$ seconds.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069C - Random Shuffle

We are given the final outcome of a deterministic shuffling process applied to the sequence of integers from 1 to n. The process builds the array incrementally.

Practice › Codeforces Solutions › 2020 ICPC Asia East Continent Final ›

CF 103069A - Namomo Subsequence

We are given a single long string consisting of letters and digits. From this string we want to count how many ways we can choose six positions in increasing order such that the chosen characters “match the pattern structure” of the word namomo.