Codeforces Round 1004 (Div. 1)

Solutions for Codeforces Round 1004 (Div. 1) (contest 2066). 1/7 problems verified against sample I/O. Difficulty range: 1400-3300.

7 items

Codeforces Round 1004 (Div. 1)

Type: Div. 1 | Problems: 7 | Verified: 1/7 | Rating range: 1400-3300 | Time: 14m 39s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Object Identification	1400	graphs, greedy, implementation	2m 5s	✗
B	White Magic	1900	constructive-algorithms, data-structures, dp	1m 39s	✗
C	Bitwise Slides	2300	bitmasks, combinatorics, dp	1m 39s	✓
D1	Club of Young Aircraft Builders (easy version)	2400	combinatorics, dp, math	2m	✗
D2	Club of Young Aircraft Builders (hard version)	2900	combinatorics, dp, math	3m 26s	✗
E	Tropical Season	3300	binary-search, data-structures, greedy	1m 41s	✗
F	Curse	3300	constructive-algorithms, dp, math	2m 9s	✗

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

CF 2066F - Curse

We are given two arrays of integers, a and b, and we are asked whether we can transform a into b using a very particular operation.

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

CF 2066D2 - Club of Young Aircraft Builders (hard version)

We are asked to restore missing information in a sequence of airplane launches by residents in a building. Each floor has exactly one resident, and the residents launch paper airplanes sequentially.

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

CF 2066E - Tropical Season

We are given a changing multiset of barrel volumes. Each barrel has a numeric value, and exactly one barrel is “special” in the sense that it carries an invisible poison.

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

CF 2066D1 - Club of Young Aircraft Builders (easy version)

We are asked to count the number of valid sequences of airplane launches from a building with n floors. Each floor has exactly one resident, and all residents want to collectively launch at least c airplanes. The building has m total launches.

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

CF 2066A - Object Identification

The failure you show is not enough to diagnose the algorithm itself. Let's trace what happened: The input contains 5 test cases: The program produced only: instead of: This means the code successfully processed the first test case and then terminated before handling the…

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

CF 2066B - White Magic

We are given an array of non-negative integers, and we are allowed to pick a subsequence from it. From that subsequence, we want to keep as many elements as possible while ensuring a very specific prefix-suffix condition holds at every split point.

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

CF 2066C - Bitwise Slides

We are building a process that evolves three integers, initially all zero. We read an array from left to right, and for each element we must assign it to exactly one of the three variables. Assigning means XORing that value into the chosen variable.