Codeforces Round 500 (Div. 1) [based on EJOI]

6 problems from Codeforces Round 500 (Div. 1) [based on EJOI] (contest 1012), difficulty 1500-3400. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 500 (Div. 1) [based on EJOI]

Div. 1 | 6 problems | 3/6 verified | Difficulty 1500-3400 | 15m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Photo of The Sky	1500	brute-force, implementation, math	6,689	1m 29s	✓
B	Chemical table	1900	constructive-algorithms, dfs-and-similar, dsu	4,385	1m 39s	✓
C	Hills	1900	dp	3,827	2m 10s
D	AB-Strings	2800	constructive-algorithms, strings	426	2m 15s
E	Cycle sort	3100	dsu, math	396	2m 10s	✓
F	Passports	3400	dp, implementation	207	5m 28s

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 1) [based on EJOI] ›

CF 1012F - Passports

We are given a small collection of trips, each with a fixed start day and duration, and for each trip a visa process time that determines how long a passport is tied up after an application. Gleb has at most two passports, and each visa must be assigned to one of them.

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 1) [based on EJOI] ›

CF 1012E - Cycle sort

We are given an array of integers and allowed to rearrange it using a very specific primitive: we can take any set of indices and rotate the values sitting at those positions cyclically.

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 1) [based on EJOI] ›

CF 1012D - AB-Strings

We are given two binary strings, each consisting only of the characters a and b. The only allowed operation is to choose a prefix of the first string and a prefix of the second string, then swap those prefixes in a single move.

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 1) [based on EJOI] ›

CF 1012C - Hills

We are given a line of hills, each with a fixed initial height. We are allowed to repeatedly pick any single hill and decrease its height by one unit per operation.

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 1) [based on EJOI] ›

CF 1012B - Chemical table

We are given an $n times m$ grid where each cell is a distinct chemical element. Some of these cells are already available in the laboratory. From any three elements forming three corners of an axis-aligned rectangle, the scientists can always synthesize the fourth corner.

Practice › Codeforces Solutions › Codeforces Round 500 (Div. 1) [based on EJOI] ›

CF 1012A - Photo of The Sky

We are given a multiset of numbers of size 2n, and we are told that these numbers originally came from n points in the plane, where each point contributes exactly two integers: its x-coordinate and its y-coordinate.