Codeforces Round 545 (Div. 1)

Solutions for Codeforces Round 545 (Div. 1) (contest 1137). 3/6 problems verified against sample I/O. Difficulty range: 1600-3400.

6 items

Codeforces Round 545 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 3/6 | Rating range: 1600-3400 | Time: 9m 34s

Problem Name Rating Tags Solve Time Verified
A Skyscrapers 1600 implementation, sortings 1m 41s ✗
B Camp Schedule 1600 greedy, hashing, strings 1m 51s ✓
C Museums Tour 2500 dp, graphs, implementation 1m 25s ✓
D Cooperative Game 2400 constructive-algorithms, interactive, number-theory 1m 47s ✗
E Train Car Selection 2700 data-structures, greedy 1m 37s ✗
F Matches Are Not a Child's Play 3400 data-structures, trees 1m 13s ✓
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 1) ›

CF 1137E - Train Car Selection

We are asked to simulate a train that grows and whose car values evolve over time. Initially, there are $n$ cars numbered from the head.
codeforces competitive-programming data-structures greedy Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 1) ›

CF 1137D - Cooperative Game

We are asked to coordinate ten players on a secret graph consisting of a directed path leading to a cycle. The path has length t, ending at the start of a cycle of length c, which represents a scenic lake road. Every vertex has exactly one outgoing edge.
codeforces competitive-programming constructive-algorithms interactive number-theory Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 1) ›

CF 1137F - Matches Are Not a Child's Play

We are given a tree of n vertices, each with a unique integer priority initially equal to its label. We can imagine burning the tree in a particular order: repeatedly remove the leaf with the smallest priority until no vertices remain.
codeforces competitive-programming data-structures trees Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 1) ›

CF 1137B - Camp Schedule

We are given two binary strings. The first string s is not the schedule we must output directly. Instead, it acts as a multiset of characters.
codeforces competitive-programming greedy hashing strings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 1) ›

CF 1137A - Skyscrapers

We are given a city laid out as a grid of size $n times m$, where each cell represents an intersection containing a skyscraper of a certain height.
codeforces competitive-programming implementation sortings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 1) ›

CF 1137C - Museums Tour

We are asked to plan a tour starting from city 1 on the first day of a week, aiming to visit as many distinct museums as possible. Each city has exactly one museum, and museums have a weekly schedule specifying on which day of the week they are open.
codeforces competitive-programming dp graphs implementation Jun 12, 2026