Codeforces Round 787 (Div. 3)

Solutions for Codeforces Round 787 (Div. 3) (contest 1675). 4/7 problems verified against sample I/O. Difficulty range: 800-2300.

7 items

Codeforces Round 787 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 4/7 | Rating range: 800-2300 | Time: 19m 14s

Problem Name Rating Tags Solve Time Verified
A Food for Animals 800 greedy, math 1m 37s ✓
B Make It Increasing 900 greedy, implementation 1m 41s ✓
C Detective Task 1100 implementation 8m 31s ✗
D Vertical Paths 1300 graphs, implementation, trees 2m 6s ✗
E Replace With the Previous, Minimize 1500 dsu, greedy, strings 2m 1s ✗
F Vlad and Unfinished Business 1800 dfs-and-similar, dp, greedy 1m 37s ✓
G Sorting Pancakes 2300 dp 1m 41s ✓
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675C - Detective Task

We observe a sequence of visitors entering a room one after another. Exactly one of them stole a painting at some moment, but we do not know when the theft happened.
codeforces competitive-programming implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675G - Sorting Pancakes

The array represents stacks of pancakes placed on a row of dishes. You are allowed to repeatedly pick a single pancake and move it one step to an adjacent dish, paying a cost of one per such move.
codeforces competitive-programming dp Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675F - Vlad and Unfinished Business

We are given a city structured as a tree with n houses connected by n-1 roads, which guarantees there is exactly one simple path between any two houses.
codeforces competitive-programming dfs-and-similar dp greedy trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675D - Vertical Paths

We are given a rooted tree, but the root is not explicitly provided. Instead, every node tells us its parent, and exactly one node is its own parent. That node is the root. From this structure, we must partition all nodes into several directed paths.
codeforces competitive-programming graphs implementation trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675E - Replace With the Previous, Minimize

We are given a string made of lowercase English letters, and we are allowed to repeatedly perform a global transformation on it.
codeforces competitive-programming dsu greedy strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675B - Make It Increasing

We are given several independent arrays. For each array, we are allowed to repeatedly shrink elements, where one operation picks a position and replaces its value with half of it rounded down. No swapping is allowed, so the order of elements is fixed.
codeforces competitive-programming greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 787 (Div. 3) ›

CF 1675A - Food for Animals

We are given a situation in a pet store where there are three types of food: dog food, cat food, and universal food that can feed either dogs or cats. Polycarp owns a certain number of dogs and cats. Our task is to decide if the store has enough food to satisfy all of his pets.
codeforces competitive-programming greedy math Jun 10, 2026