CodeCraft-19 and Codeforces Round 537 (Div. 2)

Solutions for CodeCraft-19 and Codeforces Round 537 (Div. 2) (contest 1111). 2/5 problems verified against sample I/O. Difficulty range: 1000-2600.

5 items

CodeCraft-19 and Codeforces Round 537 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 2/5 | Rating range: 1000-2600 | Time: 11m 12s

Problem Name Rating Tags Solve Time Verified
A Superhero Transformation 1000 implementation, strings 5m 23s ✗
B Average Superhero Gang Power 1700 brute-force, implementation, math 1m 27s ✓
C Creative Snap 1700 binary-search, brute-force, divide-and-conquer 1m 9s ✓
D Destroy the Colony 2600 combinatorics, dp, math 1m 47s ✗
E Tree 2500 data-structures, dfs-and-similar, dp 1m 26s ✗
Practice › Codeforces Solutions › CodeCraft-19 and Codeforces Round 537 (Div. 2) ›

CF 1111A - Superhero Transformation

We are given two lowercase strings representing superhero names. A transformation is allowed if every vowel can be changed into any other vowel, and every consonant can be changed into any other consonant. The actual letters do not matter.
codeforces competitive-programming implementation strings Jun 12, 2026
Practice › Codeforces Solutions › CodeCraft-19 and Codeforces Round 537 (Div. 2) ›

CF 1111D - Destroy the Colony

We are given a row of holes, each containing exactly one villain, and each villain has a type represented by a character. The string representing the colony is of even length, so it can naturally be divided into two halves.
codeforces competitive-programming combinatorics dp math Jun 12, 2026
Practice › Codeforces Solutions › CodeCraft-19 and Codeforces Round 537 (Div. 2) ›

CF 1111E - Tree

We are given a tree with n nodes and multiple queries. Each query provides a subset of k nodes, a maximum number of groups m, and a root r.
codeforces competitive-programming data-structures dfs-and-similar dp graphs trees Jun 12, 2026
Practice › Codeforces Solutions › CodeCraft-19 and Codeforces Round 537 (Div. 2) ›

CF 1111B - Average Superhero Gang Power

We are given a group of superheroes, each with an initial power value. We are allowed to modify this group using two types of operations: we can either remove a superhero from the group (as long as at least two remain), or we can increase the power of a chosen superhero by one.
codeforces competitive-programming brute-force implementation math Jun 12, 2026
Practice › Codeforces Solutions › CodeCraft-19 and Codeforces Round 537 (Div. 2) ›

CF 1111C - Creative Snap

We are given a linear base of length $2^n$, where some positions contain avengers. Thanos wants to destroy the entire base using minimum power.
codeforces competitive-programming binary-search brute-force divide-and-conquer math Jun 12, 2026