2021 NTUIM Programming Design And Optimization (PDAO 2021)

12 problems from 2021 NTUIM Programming Design And Optimization (PDAO 2021) (contest 104257), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2021 NTUIM Programming Design And Optimization (PDAO 2021)

Special | 12 problems | 12/12 verified | Difficulty - | 11m 40s

#	Problem	Time	✓
A	Acceptable Answer	52s	✓
B	Bicycle Burglar	1m 19s	✓
C	Clubhouse Celebrity	51s	✓
D	Dom's Discovery	51s	✓
E	Easter Eggs	55s	✓
F	Frontier Fortress	1m 6s	✓
G	Go Go GPA	1m 8s	✓
H	Hiro's Hero	50s	✓
I	I'm in Iove with Instagram	1m 21s	✓
J	Jiggle Joggle	53s	✓
K	Kakalan's Karma	47s	✓
L	League of Letters	47s	✓

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257L - League of Letters

We are given a string consisting of only four possible characters: P, D, A, and O. Each character represents a type of warrior standing in a line. We are allowed to choose any contiguous segment of this line, meaning we pick a substring, and call it a “league”.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257I - I'm in Iove with Instagram

We are given a poll with two options. Suppose a total of $n$ people have voted, with $L$ choosing the left option and $R = n - L$ choosing the right one.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257K - Kakalan's Karma

We are designing a directed “grade system” with k levels, where each level i has exactly one fallback target ai satisfying 1 ≤ ai ≤ i. If a student fails the exam in grade i, they are sent back to grade ai.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257J - Jiggle Joggle

We are given a single sequence of integers, and we are allowed to delete elements while keeping the remaining elements in their original order.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257F - Frontier Fortress

We are working with a triangle whose side lengths are integers, written as $a le b le c$. From this triangle, two special points are constructed on sides $AB$ and $AC$.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257G - Go Go GPA

We are given a sequence of courses that must be taken in a fixed order. Each course has an estimated score and a credit value. The student divides these courses into exactly $K$ consecutive semesters, and each semester must contain at least one course.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257H - Hiro's Hero

We are given a sequence of test cases, and each test case provides an integer $n$. For each $n$, we consider the set ${1, 2, dots, n}$. From this set, we form every possible non-empty subset. For each subset, we compute a value defined in a slightly unusual way.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257E - Easter Eggs

Two players, Eason and Emil, play a turn-based game involving two independent piles of items. Eason starts with A eggs, Emil starts with B eggs. They alternate turns according to a fixed starting rule: either Eason goes first or Emil goes first depending on a binary flag C.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257D - Dom's Discovery

We are given a directed graph where each vertex represents a student and each directed edge represents a one-way friendship claim.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257B - Bicycle Burglar

We are given a combination lock described as a multi-dial cyclic system. Each dial behaves like a circular wheel: the i-th dial has values from 0 up to ai − 1, and turning it moves one step clockwise or counterclockwise at a fixed time cost.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257A - Acceptable Answer

We are given multiple independent queries. Each query contains two integers, and for each pair we are asked to output their arithmetic product. The input size can be large in terms of number of queries, up to one hundred thousand.

Practice › Codeforces Solutions › 2021 NTUIM Programming Design And Optimization (PDAO 2021) ›

CF 104257C - Clubhouse Celebrity

We are given a directed relationship graph over up to 2021 users. Each user may follow some subset of all users. From this universe, only a subset of size m is present in a chatroom, and the task is to determine whether there exists a “celebrity” inside this subset.