Codeforces Round 170 (Div. 1)

Solutions for Codeforces Round 170 (Div. 1) (contest 277). 1/3 problems verified against sample I/O. Difficulty range: 1400-2800.

3 items

Codeforces Round 170 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1400-2800 | Time: 6m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Learning Languages	1400	dfs-and-similar, dsu	1m 44s	✓
D	Google Code Jam	2800	dp, probabilities	2m 17s	✗
E	Binary Tree on Plane	2400	flows, trees	2m 5s	✗

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

CF 277A - Learning Languages

We can think of the company as a graph of employees. Two employees are directly connected if they share at least one language. Communication is allowed through intermediates, so if employee A can talk to B, and B can talk to C, then A and C are effectively connected as well.

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

CF 277D - Google Code Jam

Each problem in the contest has two stages. You may solve the Small version first, gaining some fixed score. After that, you may continue and attempt the Large version, gaining additional score if it succeeds.

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

CF 277E - Binary Tree on Plane

We are given a set of points in the plane, each with distinct coordinates, and we need to construct a rooted binary tree such that each node has at most two children. The arcs, which connect parents to children, must be directed strictly downward in terms of y-coordinates.