2021 ICPC Asia East Continent Final

13 problems from 2021 ICPC Asia East Continent Final (contest 103861), difficulty -. 9/13 solutions verified against sample I/O.

13 items

2021 ICPC Asia East Continent Final

ICPC/IOI | 13 problems | 9/13 verified | Difficulty - | 13m

#	Problem	Time	✓
A	DFS Order	1m 1s	✓
B	Beautiful String	51s	✓
C	String-dle Count	36s
D	Two Walls	2m 6s
E	Prof. Pang and Poker	46s	✓
F	Vacation	47s	✓
G	Check Pattern is Bad	30s
H	Check Pattern is Good	39s	✓
I	Future Coder	41s	✓
J	Elden Ring	1m 6s	✓
K	Vision Test	2m 3s
L	Fenwick Tree	45s	✓
M	Prof. Pang and Ants	1m 9s	✓

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

CF 103861M - Prof. Pang and Ants

We are given a set of underground exits, each exit connects the cave to the outside world and has its own travel cost to a refrigerator.

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

CF 103861K - Vision Test

Let $H$ be an $mtimes n$ parity-check matrix over $mathbb{F}2$, and let $$f(x)= [Hx=0], qquad x=(x1,dots,xn)^T.$$ Fix a variable order $x1,dots,xn$.

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

We are given a length-n array that starts completely zero. Instead of observing the array directly, we are told the final state only through a binary string: each position tells us whether the final value at that index is zero or not.

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

CF 103861J - Elden Ring

We are given an undirected graph where vertex 1 is the starting hub and vertex n is the final target we must eventually clear. Every vertex except 1 contains a boss with an initial strength. The player also has a strength value and evolves over time.

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

CF 103861I - Future Coder

We are given several independent test cases. In each test case, there is an array of integers, and we need to count how many pairs of positions $(i, j)$ with $i < j$ satisfy a specific inequality involving multiplication and addition of the chosen elements.

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

CF 103861D - Two Walls

Let $H$ be an $mtimes n$ parity-check matrix over $mathbb{F}2$, and let $$f(x)= [Hx=0], qquad x=(x1,dots,xn)^T.$$ Fix a variable order $x1,dots,xn$.

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

CF 103861G - Check Pattern is Bad

The prompt is missing essential information needed to write a correct editorial. The sample input and sample output in the statement are corrupted and do not line up, and there is no complete problem specification.

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

CF 103861H - Check Pattern is Good

We are given a grid where each cell already has a fixed color, or is still undecided. The final goal is to assign colors to all undecided cells so that the resulting fully colored grid contains as many valid 2 × 2 “checker” blocks as possible.

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

CF 103861F - Vacation

We are given a long sequence of days, each day having a numerical happiness value that can be positive, zero, or negative.

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

CF 103861E - Prof. Pang and Poker

We are dealing with a three-player card game involving Alice, Bob, and Prof. Pang. Each player has a private hand of cards, and all cards are distinct. Cards are ranked only by their face value, with Ace being highest and 2 being lowest, while suits are irrelevant.

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

2021 ICPC Asia East Continent Final

2021 ICPC Asia East Continent Final

CF 103861M - Prof. Pang and Ants

CF 103861K - Vision Test

CF 103861L - Fenwick Tree

CF 103861J - Elden Ring

CF 103861I - Future Coder

CF 103861D - Two Walls

CF 103861G - Check Pattern is Bad

CF 103861H - Check Pattern is Good

CF 103861F - Vacation

CF 103861E - Prof. Pang and Poker

CF 103861A - DFS Order

CF 103861B - Beautiful String

CF 103861C - String-dle Count