Codeforces Round 243 (Div. 1)

Solutions for Codeforces Round 243 (Div. 1) (contest 425). 1/3 problems verified against sample I/O. Difficulty range: 2300-2500.

3 items

Codeforces Round 243 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 2300-2500 | Time: 10m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
C	Sereja and Two Sequences	2300	data-structures, dp	6m 43s	✗
D	Sereja and Squares	2300	binary-search, data-structures, hashing	35s	✓
E	Sereja and Sets	2500	dp	2m 49s	✗

Practice › Codeforces Solutions › Codeforces Round 243 (Div. 1) ›

CF 425C - Sereja and Two Sequences

We are given two sequences of integers, a and b, and Sereja has some initial energy s and a fixed energy cost e for one type of operation. He can perform two operations repeatedly until both sequences are empty.

Practice › Codeforces Solutions › Codeforces Round 243 (Div. 1) ›

CF 425D - Sereja and Squares

We are given a set of $n$ points on a 2D plane, each with integer coordinates, and all points are distinct. The task is to count how many axis-aligned squares exist whose four corners are all points from this set.

Practice › Codeforces Solutions › Codeforces Round 243 (Div. 1) ›

CF 425E - Sereja and Sets

We are given all possible integer intervals on a line from 1 to n, and we form a subset S by choosing some of these intervals. For any chosen set S, we look at how many intervals we can pick from S such that no two overlap.