Codeforces Round 549 (Div. 1)

Solutions for Codeforces Round 549 (Div. 1) (contest 1142). 1/5 problems verified against sample I/O. Difficulty range: 1700-3200.

5 items

Codeforces Round 549 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 1/5 | Rating range: 1700-3200 | Time: 8m 46s

Problem	Name	Rating	Tags	Solve Time	Verified
A	The Beatles	1700	brute-force, math	1m 35s	✓
B	Lynyrd Skynyrd	2000	data-structures, dfs-and-similar, dp	2m 7s	✗
C	U2	2400	geometry	1m 48s	✗
D	Foreigner	2800	dp	1m 44s	✗
E	Pink Floyd	3200	graphs, interactive	1m 32s	✗

Practice › Codeforces Solutions › Codeforces Round 549 (Div. 1) ›

CF 1142E - Pink Floyd

We are given a complete undirected graph on $n$ nodes, but each edge is assigned a direction, making it a tournament. A subset of these edges are colored pink and their directions are known. The remaining edges are green, and their directions are initially unknown.

Practice › Codeforces Solutions › Codeforces Round 549 (Div. 1) ›

CF 1142D - Foreigner

We are given a long digit string that was formed by writing several integers back to back without separators. Each contiguous substring of this string can be interpreted as an integer (with no leading zeros unless the substring is exactly "0", though here the input guarantees…

Practice › Codeforces Solutions › Codeforces Round 549 (Div. 1) ›

CF 1142B - Lynyrd Skynyrd

We are given a fixed permutation of numbers from 1 to n. Separately, we have a longer array whose elements also lie in the range 1 to n, but may repeat. The task is to answer many queries on subsegments of this array.

Practice › Codeforces Solutions › Codeforces Round 549 (Div. 1) ›

CF 1142C - U2

We are given a set of points on a two-dimensional plane with integer coordinates. For each pair of points that do not share the same x-coordinate, we can uniquely define a parabola of the form $y = x^2 + bx + c$ that passes through both points.

Practice › Codeforces Solutions › Codeforces Round 549 (Div. 1) ›

CF 1142A - The Beatles

We are given a circular route that passes through $n cdot k$ cities arranged consecutively. Among these, there are $n$ fast food restaurants evenly spaced such that the distance along the circle between any two consecutive restaurants is $k$ kilometers.