2023 ICPC Columbia University Local Contest

11 problems from 2023 ICPC Columbia University Local Contest (contest 104671), difficulty -. 2/11 solutions verified against sample I/O.

11 items

2023 ICPC Columbia University Local Contest

ICPC/IOI | 11 problems | 2/11 verified | Difficulty - | 16m 54s

#	Problem	Time	✓
A	Maximize Meal Quality	1m 1s	✓
B	Starving	1m 25s
C	Destroy Columbia	1m 20s
D	Formless Canvas	1m 57s
E	Cards in a Row	1m 24s
F	Subset AND	1m 50s
G	Segment Tree Tutorial	1m 39s
H	Cyclically Coprime	1m 12s
I	Phebe and Ryan	1m 50s
J	Fox, Chicken, and Corn	2m 24s
K	Necro Fantasia by MISATO [Lasse's Lunatic] +DT 4miss 94.29 420pp	52s	✓

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671J - Fox, Chicken, and Corn

We are given a graph on $n$ labeled chickens. The graph is extremely sparse, having exactly $n-2$ edges, and it is guaranteed to be a forest.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671K - Necro Fantasia by MISATO [Lasse's Lunatic] +DT 4miss 94.29 420pp

The input is completely degenerate: it always consists of a single placeholder character. There is no hidden structure, no parameters to interpret, and no variation across test cases. Every valid program is effectively being asked to choose between two conceptual actions.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671I - Phebe and Ryan

We are given a multiset of block weights. For each weight value $i$, there are $ai$ identical blocks of weight $i$. Players alternate taking any remaining block and adding its weight to a running sum that starts at zero.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671G - Segment Tree Tutorial

We are working in a very high-dimensional grid. Each point is identified by an n-tuple of coordinates, and each coordinate ranges from 1 to 100000. Every point stores a number, initially zero.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671H - Cyclically Coprime

We are asked to arrange the numbers from 1 to n into a single sequence so that every neighboring pair has gcd equal to 1, and the sequence is also cyclic in the sense that the last element and the first element must also be coprime.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671F - Subset AND

We are working with a static array of integers, and each query gives us a segment of that array. For every segment, we must decide whether we can pick some nonempty subset of elements from that segment whose bitwise AND is exactly equal to a fixed target value k.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671D - Formless Canvas

The input describes a planar drawing built from two kinds of structures: a set of infinite horizontal and vertical lines, and a collection of axis-aligned rectangles that do not overlap each other. Together, these objects slice the plane into a finite number of connected regions.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671E - Cards in a Row

We are given a row of cards, each either face-up or face-down. A move consists of picking a position where the card is currently face-up, and then flipping every card from that position to the end of the row, including the chosen card itself. Flipping toggles each card state.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671B - Starving

We are given a one-dimensional field of cells numbered from 0 to n. Cell 0 is our starting point and is always empty. Each other cell i may contain a watermelon that initially gives a certain amount of health, or it may be empty. We start at cell 0 with initial health h.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671C - Destroy Columbia

We are given a string that can be thought of as a row of characters. We are allowed to pick any set of positions in this string, and then reverse only the characters located at those chosen positions, while leaving all other positions untouched.

Practice › Codeforces Solutions › 2023 ICPC Columbia University Local Contest ›

CF 104671A - Maximize Meal Quality

We are given a collection of numbers representing ingredient qualities. We must split these numbers into exactly k non-empty groups, where each number belongs to exactly one group. Each group represents a dish. The score of a dish is defined in a slightly unusual way.