ICPC 2024 Thailand - Chulalongkorn University Internal Round

11 problems from ICPC 2024 Thailand - Chulalongkorn University Internal Round (contest 105307), difficulty -. 1/11 solutions verified against sample I/O.

11 items

ICPC 2024 Thailand - Chulalongkorn University Internal Round

ICPC/IOI | 11 problems | 1/11 verified | Difficulty - | 17m 5s

#	Problem	Time	✓
A	Card Dealer Game	1m 25s
B	Emma and the Pixie dust	1m 34s
C	Chopsticks	1m 5s	✓
D	Animal Circus	1m 42s
E	Hidden Project	1m 28s
F	Portal Maintenance	1m 48s
G	Ki Chang Jab Takkataen	1m 47s
H	Final Quiz	1m 36s
I	Lulu And The Magical Array	1m 22s
J	Rook Placement	1m 36s
K	A Potion Shopping On This Wonderful World!	1m 42s

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307K - A Potion Shopping On This Wonderful World!

Each potion in this problem can be viewed as a subset of stat types among at most 14 possible stats. Buying a potion gives you all of its covered stats, and because the protagonist is “lucky”, every potion is guaranteed to succeed, so each chosen potion deterministically…

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307J - Rook Placement

We are maintaining a dynamic set of pawns on a very large chessboard. The board itself is too large to store explicitly, so the only meaningful information is which cells currently contain pawns.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307I - Lulu And The Magical Array

We are given an array of hidden integers. We cannot directly read the values, but we are allowed to query any pair of indices and receive the bitwise XOR of those two elements.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307G - Ki Chang Jab Takkataen

We are given a sequence of grasshoppers positioned along a straight path. Each grasshopper appears at a specific distance from the start, and when the elephant reaches that position, the grasshopper is at some vertical height.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307F - Portal Maintenance

We are given a connected system of planets linked by a tree of portals. Every portal connects two planets and has a cost that is paid whenever Isaac travels through it while his jammer is active.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307E - Hidden Project

We are given a sequence of days from 1 to N. On each day, you normally earn a fixed income of a baht value a. However, you are allowed to optionally run special projects, and each project replaces your normal income during its active days.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307D - Animal Circus

We are given several animal types, each type having a certain number of animals. On each day, one type is updated by adding or subtracting animals.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307B - Emma and the Pixie dust

We are given a large set of distinct positive integers representing “cuteness levels”. From these numbers, Emma first selects exactly $N$ elements.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307C - Chopsticks

We are given a collection of identical “pairs” of chopsticks, where each pair is characterized by a single integer length. From each pair we can treat the two chopsticks as two equal sides of a rectangle.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307H - Final Quiz

We are asked to count how many length-n sequences we can build using k symbols, where each position is a quiz answer choice. The constraint forbids any run of four identical consecutive values.

Practice › Codeforces Solutions › ICPC 2024 Thailand - Chulalongkorn University Internal Round ›

CF 105307A - Card Dealer Game

We are given a sequence of decks, each deck containing only two types of cards: red and blue. In each round, the current dealer chooses one unused deck, the deck is shuffled, and the other player picks one card uniformly at random.