Codeforces Round 144 (Div. 1)

Solutions for Codeforces Round 144 (Div. 1) (contest 232). 2/4 problems verified against sample I/O. Difficulty range: 1600-2900.

4 items

Codeforces Round 144 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 2/4 | Rating range: 1600-2900 | Time: 17m 15s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cycles	1600	binary-search, constructive-algorithms, graphs	3m 45s	✓
B	Table	1900	bitmasks, combinatorics, dp	8m 46s	✗
C	Doe Graphs	2600	constructive-algorithms, divide-and-conquer, dp	2m 23s	✓
D	Fence	2900	binary-search, data-structures, string-suffix-structures	2m 21s	✗

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

CF 232A - Cycles

We need to construct an undirected graph that contains exactly k triangles. A triangle means three different vertices where every pair is connected by an edge. The graph may contain any number of other structures, but the total number of triangles must be exactly k.

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

CF 232B - Table

We are given a table with n rows and m columns. We can place a single point in any cell, and the goal is to fill the table so that every contiguous square subtable of size n × n contains exactly k points.

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

CF 232C - Doe Graphs

The graph family is built recursively. D(0) is a single vertex. D(1) is a single edge. For every larger order, D(n) is formed by taking a copy of D(n-1) and a shifted copy of D(n-2), then connecting them with two extra edges.

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

CF 232D - Fence

We have an array of fence heights. A query gives one contiguous segment of the fence, and we must count how many other segments match it. Two segments match if they have the same length, do not overlap, and their heights differ by the same constant at every position.