Codeforces Round 165 (Div. 1)

Solutions for Codeforces Round 165 (Div. 1) (contest 269). 2/4 problems verified against sample I/O. Difficulty range: 1700-3100.

4 items

Codeforces Round 165 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 2/4 | Rating range: 1700-3100 | Time: 7m 2s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Greenhouse Effect	1700	dp	1m 21s	✓
C	Flawed Flow	2100	constructive-algorithms, flows, graphs	2m	✓
D	Maximum Waterfall	2600	data-structures, dp, graphs	1m 43s	✗
E	String Theory	3100	geometry, math, strings	1m 58s	✗

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

CF 269B - Greenhouse Effect

We are asked to organize a sequence of plants along a one-dimensional greenhouse so that each species occupies a contiguous segment, numbered left to right from 1 to m. Every plant has a species label and a fixed position on the line.

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

CF 269C - Flawed Flow

We are given an undirected graph where every edge already has a flow amount attached to it. The graph is supposed to represent a valid maximum flow from vertex 1 to vertex n, but the directions of the edges were lost.

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

CF 269D - Maximum Waterfall

We are asked to simulate a waterfall that flows from the top of a wall to the bottom across horizontal panels. Each panel is a horizontal segment at some height, spanning a range along the x-axis.

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

CF 269E - String Theory

We are given a rectangular harp represented as a grid of size n × m, where pins are placed along the edges: n pins on the left and right sides, and m pins on the top and bottom sides. Each string connects exactly two pins located on different sides of the rectangle.