BioCode 2024

8 problems from BioCode 2024 (contest 105123), difficulty -. 2/8 solutions verified against sample I/O.

8 items

BioCode 2024

Special | 8 problems | 2/8 verified | Difficulty - | 10m 33s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Mitosis				56s	✓
B	Neural Network				1m 15s
C	Flipped DNA				1m 17s	✓
E	Powerhouse of the Cell?				1m 15s
F	Wildfires				1m 21s
G	Cut and Splice				1m 35s
H	Bacteria Colony				1m 20s
I	Evolutionary Pathways				1m 34s

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123I - Evolutionary Pathways

We are given a final set of species labeled from 1 to n, where label corresponds to fitness and also to the order constraint that parents always have smaller labels than children.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123H - Bacteria Colony

We are given the current snapshot of all bacteria that are alive on an infinite integer grid. We are told that originally there was a single bacterium at some unknown grid point, and after some unknown number of minutes, bacteria spread through Manhattan-adjacent moves.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123G - Cut and Splice

We start with a single circular RNA string made of four possible characters. Over time, this structure is transformed by two kinds of operations that interact in a very specific way.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123F - Wildfires

We are given a linear habitat made of forests, each forest having a numeric “resistance” value. A wildfire can start at a chosen forest with some initial integer strength and then spread left and right across adjacent forests.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123E - Powerhouse of the Cell?

We are given a sequence of tasks ordered by priority from first to last, and each task consumes a fixed amount of ATP to complete. Jasmine has a daily ATP budget of $m$, and she cannot repeat tasks. The twist is that she does not always consider all tasks.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123C - Flipped DNA

We are given two DNA strings of equal length, composed only of the characters A, T, C, and G. Each position represents a nucleotide, and we are asked to decide whether the second string can be obtained from the first using only mutations that swap complementary bases.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123B - Neural Network

We are given a layered structure where each layer contains a certain number of nodes. Between every pair of consecutive layers, every node in the left layer is connected to every node in the right layer.

Practice › Codeforces Solutions › BioCode 2024 ›

CF 105123A - Mitosis

A cell starts with c chromosomes and divides into two daughter cells containing a and b chromosomes. The division is considered correct only if every chromosome ends up in exactly one of the two daughter cells.