Codeforces Round 103 (Div. 2)

Solutions for Codeforces Round 103 (Div. 2) (contest 144). 5/5 problems verified against sample I/O. Difficulty range: 800-2200.

5 items

Codeforces Round 103 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2200 | Time: 8m 5s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Arrival of the General	800	implementation	1m 52s	✓
B	Meeting	1300	implementation	1m 15s	✓
C	Anagram Search	1500	implementation, strings	1m 23s	✓
D	Missile Silos	1900	data-structures, dfs-and-similar, graphs	2m 10s	✓
E	Competition	2200	data-structures, greedy	1m 25s	✓

Practice › Codeforces Solutions › Codeforces Round 103 (Div. 2) ›

CF 144A - Arrival of the General

We have a line of soldiers, each with a height. The general only cares about two positions in the lineup. The tallest soldier must stand at the very front, and the shortest soldier must stand at the very end. The order of everyone else is irrelevant.

Practice › Codeforces Solutions › Codeforces Round 103 (Div. 2) ›

CF 144B - Meeting

We are asked to determine how many generals need warm blankets at a rectangular table placed on an infinite Cartesian plane. The table corners are given by two points with integer coordinates, and each integer point along the perimeter of the rectangle hosts a general.

Practice › Codeforces Solutions › Codeforces Round 103 (Div. 2) ›

CF 144C - Anagram Search

We are asked to count the number of substrings of a string s that can be transformed into an anagram of a given string p. The string s can contain question marks ?, which can be replaced by any lowercase letter.

Practice › Codeforces Solutions › Codeforces Round 103 (Div. 2) ›

CF 144D - Missile Silos

We are given a connected weighted undirected graph representing cities and roads. City s is the capital. A missile silo may be located either exactly on a city or at some interior point of a road. A position is valid if its shortest-path distance to the capital is exactly l.

Practice › Codeforces Solutions › Codeforces Round 103 (Div. 2) ›

CF 144E - Competition

We are given a triangular region of a square matrix called an n-degree staircase. In this staircase, each cell is accessible except for the area above the secondary diagonal, which runs from the top right to the bottom left.