Codeforces Round 134 (Div. 2)

Solutions for Codeforces Round 134 (Div. 2) (contest 218). 0/2 problems verified against sample I/O. Difficulty range: 1100-1100.

2 items

Codeforces Round 134 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1100-1100 | Time: 4m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Mountain Scenery	1100	brute-force, constructive-algorithms, implementation	2m 49s	✗
B	Airport	1100	implementation	1m 24s	✗

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

CF 218A - Mountain Scenery

We are given a polyline representing mountain peaks. The polyline has 2n + 1 vertices, with even-indexed vertices (2, 4, 6, ..., 2n) representing peaks. In the initial picture, each peak is strictly higher than its neighbors, i.e., for every even i, y[i-1] < y[i] y[i+1].

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

CF 218B - Airport

The airport has multiple planes, each with a certain number of empty seats. Every passenger in a queue can choose any plane to buy a ticket from, and the cost of the ticket equals the number of currently empty seats in that plane at the time of purchase.