Codeforces Beta Round 83 (Div. 1 Only)

Solutions for Codeforces Beta Round 83 (Div. 1 Only) (contest 107). 5/5 problems verified against sample I/O. Difficulty range: 1400-2700.

5 items

Codeforces Beta Round 83 (Div. 1 Only)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1400-2700 | Time: 11m 41s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Dorm Water Supply	1400	dfs-and-similar, graphs	2m 19s	✓
B	Basketball Team	1600	combinatorics, dp, math	2m 22s	✓
C	Arrangement	2400	bitmasks, dp	2m 35s	✓
D	Crime Management	2400	dp, graphs, matrices	2m 6s	✓
E	Darts	2700	geometry, probabilities	2m 19s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 1 Only) ›

CF 107A - Dorm Water Supply

The houses and pipes form a directed graph with a very special structure. Every house can have at most one incoming pipe and at most one outgoing pipe. That restriction changes the graph from a general directed graph into a collection of independent chains.

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 1 Only) ›

CF 107B - Basketball Team

We have a university with several departments. Each department contributes some number of basketball players. Herr Wafa belongs to department h, and he is already guaranteed a place on the final team. The team must contain exactly n players including Wafa himself.

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 1 Only) ›

CF 107C - Arrangement

We have n seats and n professors. Professor 1 is the most senior, professor n is the least senior. Some pairs of seats impose ordering constraints. If (a, b) is given, then the professor sitting in seat a must be more senior than the professor sitting in seat b.

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 1 Only) ›

CF 107D - Crime Management

Zeyad wants to commit exactly n crimes in a sequence so that he avoids any punishment. Each crime type is represented by a capital letter, and for some crimes there are conditions describing multiplicities: committing that crime a number of times divisible by its multiplicity…

Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 1 Only) ›

CF 107E - Darts

We have several rectangles on the plane. Each rectangle represents a photo hanging on a wall. The rectangles may overlap, may share edges, may coincide completely, and may also be rotated arbitrarily.