Codeforces Round 544 (Div. 3)

Solutions for Codeforces Round 544 (Div. 3) (contest 1133). 5/7 problems verified against sample I/O. Difficulty range: 1000-1900.

7 items

Codeforces Round 544 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 5/7 | Rating range: 1000-1900 | Time: 9m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Middle of the Contest	1000	implementation	1m 7s	✓
B	Preparation for International Women's Day	1200	math, number-theory	1m 14s	✓
C	Balanced Team	1200	sortings, two-pointers	1m 9s	✓
D	Zero Quantity Maximization	1500	hashing, math, number-theory	1m 13s	✓
E	K Balanced Teams	1800	dp, sortings, two-pointers	1m 5s	✓
F1	Spanning Tree with Maximum Degree	1600	graphs	1m 58s	✗
F2	Spanning Tree with One Fixed Degree	1900	constructive-algorithms, dfs-and-similar, dsu	1m 31s	✗

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133F2 - Spanning Tree with One Fixed Degree

We are given a connected undirected simple graph and asked to construct a spanning tree using only existing edges. The additional constraint is that vertex 1 must have degree exactly D in the chosen tree.

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133F1 - Spanning Tree with Maximum Degree

We are given a connected undirected graph and must select exactly $n-1$ of its edges so that they form a spanning tree. Among all possible spanning trees, we want one whose largest vertex degree is as large as possible. A spanning tree connects all vertices without cycles.

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133D - Zero Quantity Maximization

We are given two arrays of integers, a and b, each with n elements. We are asked to construct a new array c using a single real number d such that each element ci equals d ai + bi. Our goal is to choose d to maximize the number of zeros in c.

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133E - K Balanced Teams

We have a list of students, each with a programming skill level. The task is to divide these students into at most k teams so that the total number of students included is maximized.

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133B - Preparation for International Women's Day

We are given a set of candy boxes, each containing a certain number of candies, and a number k representing the group size for which we want to prepare gifts. A gift consists of exactly two boxes, and the sum of candies in the two boxes must be divisible by k.

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133C - Balanced Team

We have a list of students, each with a programming skill score. The task is to form the largest possible team such that the difference between the highest-skilled and lowest-skilled members does not exceed 5. In other words, for any team of size $k$, if the skills are $s1, s2, .

Practice › Codeforces Solutions › Codeforces Round 544 (Div. 3) ›

CF 1133A - Middle of the Contest

The task is to find the exact midpoint of a contest given its start and end times in hours and minutes. The input gives the start time as h1:m1 and the end time as h2:m2.