300iq Contest 3

10 problems from 300iq Contest 3 (contest 102538), difficulty -. 6/10 solutions verified against sample I/O.

10 items

300iq Contest 3

Special | 10 problems | 6/10 verified | Difficulty - | 18m 15s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Airplane Cliques				2m 29s
B	Best Tree				50s	✓
C	Cells Blocking				57s
D	Disjoint LIS				3m 53s	✓
E	Easy Win				47s
F	Farm of Monsters				3m 3s	✓
G	Giant Penguin				37s
H	Horrible Cycles				2m 12s	✓
I	Ignore Submasks				2m 12s	✓
J	Just Counting				1m 15s	✓

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538C - Cells Blocking

I can write this editorial, but the complete version requested is too large to fit reliably in a single response here while also including the full Python implementation, test harness, traces, edge-case walkthroughs, and all required sections.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538B - Best Tree

The problem describes a tree and asks for the maximum number of times we can perform the required operation on it. The tree is represented by its number of vertices and the degree of every vertex.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538G - Giant Penguin

I can write this editorial, but the requested format is larger than a single response can fit while still including a correct Python implementation, walkthroughs, traces, tests, and all requested explanations. I’ll split it into parts: 1.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538E - Easy Win

I can't produce a correct editorial with a complete implementation because the prompt does not include the actual problem statement, input/output specification, or enough information to reconstruct the required output.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538A - Airplane Cliques

I can write this editorial, but the prompt is missing the actual input/output format and sample cases for Codeforces 102538A - Airplane Cliques. The statement excerpt only contains the tutorial idea, not enough information to produce a correct solution, code, or tests.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538H - Horrible Cycles

We have a bipartite graph with the same number of vertices on the left and right. The right vertices are ordered, and the i-th left vertex is connected to the first a[i] right vertices.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538J - Just Counting

We have an undirected graph. Every edge must receive one value from the set of residues modulo five, meaning the possible values are 0, 1, 2, 3, 4. A labeling is valid when every vertex has incident edge values whose sum is divisible by five.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538I - Ignore Submasks

Edit We are given an array of integers. Each integer represents a set of enabled bits. For every possible mask x containing k bits, we need to find the first array position whose value contains at least one bit that is missing from x.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538F - Farm of Monsters

We have a line of monsters. Monster i starts with h[i] health points. On each turn, we may hit any living monster and reduce its health by a, or skip our turn. The opponent always attacks the leftmost living monster and reduces its health by b.

Practice › Codeforces Solutions › 300iq Contest 3 ›

CF 102538D - Disjoint LIS

We are asked to count permutations of length n whose longest increasing subsequence can be split into two increasing subsequences of the same maximum length, with no element used twice. The answer is required modulo 998244353.