Codeforces Round 248 (Div. 2)

5 problems from Codeforces Round 248 (Div. 2) (contest 433), difficulty 1100-2500. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 248 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1100-2500 | 10m 22s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Kitahara Haruki's Gift	1100	brute-force, implementation	17,889	1m 39s	✓
B	Kuriyama Mirai's Stones	1200	dp, implementation, sortings	53,791	1m 6s	✓
C	Ryouko's Memory Note	1800	implementation, math, sortings	2,619	4m 25s	✓
D	Nanami's Digital Board	2000	dsu, implementation	1,317	1m 29s	✓
E	Tachibana Kanade's Tofu	2500	dp	532	1m 43s

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

CF 433B - Kuriyama Mirai's Stones

We have a sequence of stones, each with a numeric cost. Kuriyama Mirai wants to ask two types of questions repeatedly: in the first type, she asks for the sum of the costs of stones in a contiguous segment of the original sequence; in the second type, she asks for the sum of…

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

CF 433E - Tachibana Kanade's Tofu

We are asked to count numbers in a given range [l, r] (expressed in base m) that satisfy a certain “value” constraint. Each number starts with value zero. We are given n patterns, each a sequence of digits in base m, with an associated integer value.

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

CF 433C - Ryouko's Memory Note

The notebook pages are numbered from 1 to n. The sequence a describes the order in which Ryouko will read information. If two consecutive pieces of information are on pages a[i] and a[i+1], she must turn The total effort is the sum of these distances over all consecutive pairs.

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

CF 433D - Nanami's Digital Board

We have a dynamic binary grid. A cell containing 1 is lit, a cell containing 0 is dark. Two kinds of operations appear. A modification flips one cell. A query asks for the largest all-1 rectangle whose border contains a given cell (x, y). The cell does not need to be a corner.

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

CF 433A - Kitahara Haruki's Gift

We are given a collection of apples where every apple weighs either 100 grams or 200 grams. All apples must be distributed between two people, and each apple must go entirely to one person because apples cannot be cut.