Codeforces Round 918 (Div. 4)

Solutions for Codeforces Round 918 (Div. 4) (contest 1915). 6/7 problems verified against sample I/O. Difficulty range: 800-1800.

7 items

Codeforces Round 918 (Div. 4)

Type: Div. 4 | Problems: 7 | Verified: 6/7 | Rating range: 800-1800 | Time: 13m 49s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Odd One Out	800	bitmasks, implementation	1m 21s	✓
B	Not Quite Latin Square	800	bitmasks, brute-force, implementation	1m 29s	✓
C	Can I Square?	800	binary-search, implementation	2m 1s	✓
D	Unnatural Language Processing	900	greedy, implementation, strings	1m 49s	✓
E	Romantic Glasses	1300	data-structures, greedy, math	2m 54s	✗
F	Greetings	1500	data-structures, divide-and-conquer, sortings	2m 5s	✓
G	Bicycles	1800	graphs, greedy, implementation	2m 10s	✓

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915G - Bicycles

We are given a map of cities connected by roads, where each road has a fixed distance. Slavic starts at city 1 and wants to reach city n. The twist is that he does not own a bike initially, but every city has exactly one bike with a certain slowness factor.

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915E - Romantic Glasses

We are given a line of glasses, each containing a certain amount of juice. Iulia drinks from the odd-numbered glasses and her date drinks from the even-numbered glasses.

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915F - Greetings

We are given a set of people on a one-dimensional number line. Each person has a starting point and a destination, and all starting and ending points are distinct. Everyone begins moving simultaneously at a constant speed of one unit per second toward their destination.

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915D - Unnatural Language Processing

We are given a sequence of letters consisting only of a, b, c, d, and e. The letters are divided into vowels (a and e) and consonants (b, c, d).

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915C - Can I Square?

We are given several buckets, and each bucket contains some number of unit squares. All squares are identical and have side length 1. The question is simple: if we take every square from every bucket, can they be arranged to form one larger square with no squares left over?

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915B - Not Quite Latin Square

We are given a fixed 3 by 3 grid containing the characters A, B, and C, with the structure of a Latin square except for one missing cell. A valid Latin square here means that each row contains exactly one of each letter A, B, and C, and the same holds for each column.

Practice › Codeforces Solutions › Codeforces Round 918 (Div. 4) ›

CF 1915A - Odd One Out

We are given a stream of very small independent tasks. Each task consists of exactly three digits, and we are promised a specific structure: among the three values, two are identical and one is different.