Bayan 2015 Contest Warm Up

Solutions for Bayan 2015 Contest Warm Up (contest 475). 4/6 problems verified against sample I/O. Difficulty range: 1100-2900.

6 items

Bayan 2015 Contest Warm Up

Type: Special | Problems: 6 | Verified: 4/6 | Rating range: 1100-2900 | Time: 11m 19s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Bayan Bus	1100	implementation	1m 59s	✓
B	Strongly Connected City	1400	brute-force, dfs-and-similar, graphs	59s	✓
C	Kamal-ol-molk's Painting	2100	brute-force, constructive-algorithms, greedy	2m 56s	✗
D	CGCDSSQ	2000	brute-force, data-structures, math	1m 11s	✓
E	Strongly Connected City 2	2700	dfs-and-similar	2m 26s	✓
F	Meta-universe	2900	data-structures	1m 48s	✗

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475A - Bayan Bus

The bus layout is fixed and already drawn for us. There are 34 passenger seats in total. Passengers always occupy seats in a very specific order: they start from the last row, fill it from left to right, then move upward row by row.

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475B - Strongly Connected City

We are asked to determine if a city with a grid of horizontal and vertical streets is "strongly connected" once each street is made one-way. The city can be visualized as a grid of intersections, with n horizontal streets and m vertical streets forming n × m junctions.

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475C - Kamal-ol-molk's Painting

We are given a grid where some cells are marked X. These are the cells that were painted at least once. Originally, a rectangular brush of size h × w was placed somewhere on the grid. After that, the brush was moved several times.

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475D - CGCDSSQ

We are given a list of integers and a set of queries. Each query asks how many contiguous subarrays of the list have a greatest common divisor equal to the query value.

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475E - Strongly Connected City 2

We start with a connected undirected graph. Every edge must be assigned a direction. After all directions are chosen, some ordered pairs of vertices $(u,v)$ will satisfy that there is a directed path from $u$ to $v$. The goal is not to make the graph strongly connected.

Practice › Codeforces Solutions › Bayan 2015 Contest Warm Up ›

CF 475F - Meta-universe

We are given a set of points on an infinite 2D grid, representing planets in a "meta-universe." The goal is to repeatedly split the set of planets along empty rows or columns that completely separate the set into two non-empty subsets, each lying on one side of the row or column.