Codeforces Round 119 (Div. 1)

Solutions for Codeforces Round 119 (Div. 1) (contest 187). 4/5 problems verified against sample I/O. Difficulty range: 1500-2900.

5 items

Codeforces Round 119 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1500-2900 | Time: 10m 3s

Problem Name Rating Tags Solve Time Verified
A Permutations 1500 greedy 1m 30s ✓
B AlgoRace 1800 dp, shortest-paths 2m 5s ✓
C Weak Memory 2000 dfs-and-similar, dsu 2m 12s ✓
D BRT Contract 2800 data-structures 1m 54s ✓
E Heaven Tour 2900 data-structures, greedy 2m 22s ✗
Practice › Codeforces Solutions › Codeforces Round 119 (Div. 1) ›

CF 187A - Permutations

We are given two permutations containing the numbers from 1 to n. The first permutation is the current arrangement, and the second permutation is the target arrangement we want to reach. The allowed operation is unusual.
codeforces competitive-programming greedy May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 119 (Div. 1) ›

CF 187B - AlgoRace

We have a complete directed graph on n cities. For every car type, we know the travel time between every ordered pair of cities. These travel times are not guaranteed to be symmetric, so going from u to v may cost something different than going from v to u.
codeforces competitive-programming dp shortest-paths May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 119 (Div. 1) ›

CF 187C - Weak Memory

We have an undirected graph representing intersections and roads inside the park. Some intersections contain volunteers. PMP starts at intersection s, and the bus station is at intersection t. PMP has weak memory.
codeforces competitive-programming dfs-and-similar dsu May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 119 (Div. 1) ›

CF 187D - BRT Contract

A bus travels through a fixed sequence of road segments. Between consecutive segments there are traffic lights, and every light follows the same synchronized cycle. Each cycle lasts g + r seconds.
codeforces competitive-programming data-structures May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 119 (Div. 1) ›

CF 187E - Heaven Tour

We have n people placed on a line at strictly increasing coordinates. PMP starts at person s, which immediately counts as visited. Every later move must go either strictly left or strictly right, depending on the ticket used for that move.
codeforces competitive-programming data-structures greedy May 29, 2026