Codeforces Round 980 (Div. 2)

Solutions for Codeforces Round 980 (Div. 2) (contest 2024). 1/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 980 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2900 | Time: 26m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Profitable Interest Rate	800	greedy, math	1m 39s	✓
B	Buying Lemonade	1100	binary-search, constructive-algorithms, sortings	5m 11s	✗
C	Concatenation of Arrays	1300	constructive-algorithms, greedy, sortings	4m 45s	✗
D	Skipping	1700	constructive-algorithms, data-structures, divide-and-conquer	5m 19s	✗
E	C+K+S	2400	constructive-algorithms, graphs, hashing	3m 38s	✗
F	Many Games	2900	dp, math	5m 49s	✗

Practice › Codeforces Solutions › Codeforces Round 980 (Div. 2) ›

CF 2024F - Many Games

Each game has a success probability $pi/100$ and a reward $wi$. We may choose any subset of games. The catch is that we receive the reward only if every chosen game is won. If even one chosen game is lost, the final reward becomes zero.

Practice › Codeforces Solutions › Codeforces Round 980 (Div. 2) ›

CF 2024E - C+K+S

We are given two directed graphs, each with the same number of vertices, and we are asked to add exactly one edge from each outgoing vertex to an incoming vertex in the other graph.

Practice › Codeforces Solutions › Codeforces Round 980 (Div. 2) ›

CF 2024D - Skipping

We are given a process that starts from problem 1 and moves through problems in a very unusual way. At each problem, we either submit it or skip it. Submitting gives us points and forces the next problem to be chosen only from strictly smaller indices than the current one.

Practice › Codeforces Solutions › Codeforces Round 980 (Div. 2) ›

CF 2024B - Buying Lemonade

We have a vending machine with n hidden slots, each containing a known number of lemonade cans. There are also n buttons, each mapped to exactly one slot, but the mappings are lost.

Practice › Codeforces Solutions › Codeforces Round 980 (Div. 2) ›

CF 2024C - Concatenation of Arrays

We are given several test cases, and each test case consists of a collection of pairs. Each pair behaves like a tiny block of length two, and we are allowed to reorder these blocks arbitrarily. After choosing an order, we concatenate all blocks into one long array of length $2n$.

Practice › Codeforces Solutions › Codeforces Round 980 (Div. 2) ›

CF 2024A - Profitable Interest Rate

We are given two types of bank deposits and a number of coins Alice has. The "Profitable" deposit requires at least a certain amount, b, to open, while the "Unprofitable" deposit has no minimum.