The 2022 ICPC Asia Tehran Regional Contest

11 problems from The 2022 ICPC Asia Tehran Regional Contest (contest 105637), difficulty -. 8/11 solutions verified against sample I/O.

11 items

The 2022 ICPC Asia Tehran Regional Contest

ICPC/IOI | 11 problems | 8/11 verified | Difficulty - | 7m 4s

#	Problem	Time	✓
A	Final Price	34s	✓
B	Flower Festival	42s	✓
C	Simplification	31s
D	Dominoes	40s	✓
E	Parking Party	49s	✓
F	Ammunition Storage	20s
G	Laboratory Report	1m	✓
H	Network Topology in Hezardastan	45s	✓
I	Windcatchers	39s	✓
J	Magic with Cards	21s
K	Iranian Hazfi Cup	43s	✓

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637J - Magic with Cards

We are not actually given the original statement in the prompt, and “Magic with Cards” (Codeforces 105637J) does not correspond to a standard indexed problem I can reliably reconstruct without risking inventing details.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637H - Network Topology in Hezardastan

We are given a bipartite connection structure between two types of objects: terminals and servers. Each terminal can connect to a subset of servers, described by a binary matrix. A connection is allowed only if the corresponding matrix entry is 1.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637B - Flower Festival

The problem describes a straight road of length (f) leading to a festival location at position (f). There are (n) cars currently on this road. Each car has a known position (xi), measured as its distance from the start of the road, and a constant speed (vi).

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637I - Windcatchers

We are given a set of points on the plane, each representing a windcatcher. The task is to place an infinite straight strip-shaped highway. The highway consists of two parallel lanes of equal width, separated by a central line.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637G - Laboratory Report

We are given a sequence of elements that arrive one by one, and after each prefix we are asked to compute a value that depends on all elements seen so far.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637F - Ammunition Storage

I don’t have the actual statement for Codeforces 105637F - Ammunition Storage, and I can’t reconstruct the intended problem reliably from the title alone.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637D - Dominoes

We are given a full tiling of an $n times m$ grid by dominoes, where every domino occupies exactly two adjacent cells either horizontally or vertically.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637A - Final Price

We are given a simple model of how a price evolves over time. There is an initial value representing the price on the first day, and then for each subsequent day we are given how much the price changes compared to the previous day.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637K - Iranian Hazfi Cup

The problem describes a knockout football tournament with a fixed structure. There are exactly $2^k$ teams, and the tournament is played as a perfect elimination bracket: teams are placed into $2^k$ initial positions, and every match eliminates one participant until a single…

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637E - Parking Party

We are given a rectangular parking lot modeled as an n by m grid. Some cells contain pillars, which permanently block movement and parking. The remaining cells are empty spaces where cars may eventually stop. Cars do not move freely in the grid.

Practice › Codeforces Solutions › The 2022 ICPC Asia Tehran Regional Contest ›

CF 105637C - Simplification

I cannot reliably reconstruct the editorial for “Codeforces 105637C - Simplification” from the information available in standard public references.