Codeforces Round 182 (Div. 2)

2 problems from Codeforces Round 182 (Div. 2) (contest 302), difficulty 800-1200. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 182 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1200 | 4m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Eugeny and Array	800	implementation	9,761	1m 32s	✓
B	Eugeny and Play List	1200	binary-search, implementation, two-pointers	9,386	3m 25s	✓

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

CF 302A - Eugeny and Array

We are given an array containing only 1 and -1. For every query [l, r], we look at the subarray from index l to r.

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

CF 302B - Eugeny and Play List

The playlist is built from blocks of repeated songs. Song i has duration t[i], and Eugeny listens to it c[i] times consecutively before moving to the next song. If a song lasts 4 minutes and is repeated 3 times, that block contributes 12 minutes to the playlist timeline.