2020 ICPC Shanghai Site

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900K - Traveling Merchant

Let $n ge m ge 1$ and let $a1 ge a2 ge cdots ge am ge 1$ be a partition of $n$ such that $ Indeed, if $a1$ is the maximum part and $am$ is the minimum part, the condition gives $a1 - am le 1$, hence $am in {a1, a1 - 1}$. Therefore every part equals either $a1$ or $a1 - 1$.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900J - Octasection

We are given a collection of axis-aligned 3D boxes in space. Each box represents a solid region defined by independent intervals on the x, y, and z axes. Boxes may overlap in any way.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900M - Gitignore

I can’t write a correct editorial for “Codeforces 102900M - Gitignore” because the actual problem statement is missing from your prompt. Right now I don’t know what the input represents, what operations are allowed, or what the output should compute.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900L - Traveling in the Grid World

The problem statement is missing from your prompt, so I don’t have the actual rules for the grid world (movement rules, goals, constraints, etc.). Without that, any editorial would be fabricated and likely useless.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900H - Rice Arrangement

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 102900H - Rice Arrangement is missing from your prompt.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900B - Mine Sweeper II

Let $n ge m ge 1$ and let $a1 ge a2 ge cdots ge am ge 1$ be a partition of $n$ such that $ Indeed, if $a1$ is the maximum part and $am$ is the minimum part, the condition gives $a1 - am le 1$, hence $am in {a1, a1 - 1}$. Therefore every part equals either $a1$ or $a1 - 1$.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900I - Sky Garden

I can’t write a correct editorial without the actual problem statement. Right now the “Problem Statement / Input / Output” sections are empty, and Codeforces solutions are entirely driven by the precise structure of the task.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900F - Fountains

The problem works with a sequence of values arranged on a line, where each value represents the “weight” of a unit segment. From these values we can compute the sum of any contiguous segment, which we will call its segment weight.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900G - Fibonacci

The problem statement is missing from your prompt, so I don’t actually know what Codeforces 102900G - Fibonacci is asking. Right now I only see the title, but no definition of the input, output, or task.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900E - The Journey of Geor Autumn

The problem statement is missing from your prompt (the “Problem Statement / Input / Output” sections are empty), so there’s no way to reconstruct Codeforces 102900E reliably.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900D - Walker

We are given a one-dimensional segment from 0 to n. Two walkers start somewhere on this segment. Each walker has its own starting position and its own constant speed, and both are allowed to walk back and forth along the segment, but they can never step outside the interval.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900A - Wowoear

The task describes a geometric race path made of straight segments connected end to end in the plane. A runner starts at the first point of a polyline and must follow the segments in order until the last point.

Practice › Codeforces Solutions › 2020 ICPC Shanghai Site ›

CF 102900C - Sum of Log

We are given two integers $X$ and $Y$, and we consider all pairs $(i, j)$ where $0 le i le X$ and $0 le j le Y$. For each pair, we only care about those where the bitwise AND of the two numbers is zero, meaning the two numbers never share a common set bit.

#	Problem	Time	✓
A	Wowoear	51s	✓
B	Mine Sweeper II	2m 41s
C	Sum of Log	48s	✓
D	Walker	43s	✓
E	The Journey of Geor Autumn	49s
F	Fountains	45s	✓
G	Fibonacci	29s
H	Rice Arrangement	42s
I	Sky Garden	23s
J	Octasection	1m 8s	✓
K	Traveling Merchant	2m 42s
L	Traveling in the Grid World	26s
M	Gitignore	29s