Codeforces Round 261 (Div. 2)

Solutions for Codeforces Round 261 (Div. 2) (contest 459). 4/5 problems verified against sample I/O. Difficulty range: 1200-1900.

5 items

Codeforces Round 261 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1200-1900 | Time: 8m 37s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Pashmak and Garden	1200	implementation	1m 3s	✓
B	Pashmak and Flowers	1300	combinatorics, implementation, sortings	1m 31s	✓
C	Pashmak and Buses	1900	combinatorics, constructive-algorithms, math	1m 59s	✗
D	Pashmak and Parmida's problem	1800	data-structures, divide-and-conquer, sortings	2m 17s	✓
E	Pashmak and Graph	1900	dp, sortings	1m 47s	✓

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

CF 459A - Pashmak and Garden

We are given the coordinates of two distinct trees on a Cartesian plane, and we know that the garden forms a perfect square aligned with the axes. Each vertex of the square has a tree, so there are exactly four trees.

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

CF 459B - Pashmak and Flowers

We are given the beauty values of n flowers. We must choose exactly two flowers. Among all possible pairs, we are interested only in pairs whose beauty difference is as large as possible.

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

CF 459C - Pashmak and Buses

We need to assign each student to one of k buses on each of d days. For every student, we can think of their assignment as a sequence of length d. For example, if d = 3, a student might ride buses (2, 1, 2) over the three days.

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

CF 459D - Pashmak and Parmida's problem

We are given an array a[1..n]. For every position i, define the value L[i] = number of occurrences of a[i] in the prefix [1..i]. For every position j, define R[j] = number of occurrences of a[j] in the suffix [j..n].

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

CF 459E - Pashmak and Graph

We are given a directed graph where every edge has a weight. We want the longest possible path measured by the number of edges, with one restriction: whenever we move from one edge to the next, the new edge must have a strictly larger weight than the previous one.