Codeforces Global Round 6

5 problems from Codeforces Global Round 6 (contest 1266), difficulty 1000-3300. 1/5 solutions verified against sample I/O.

5 items

Codeforces Global Round 6

Global | 5 problems | 1/5 verified | Difficulty 1000-3300 | 18m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Dice Tower	1000	constructive-algorithms, math	16,578	2m 2s	✓
C	Diverse Matrix	1400	constructive-algorithms, greedy, math	10,068	2m 46s
E	Spaceship Solitaire	2100	data-structures, greedy, implementation	2,348	3m 58s
F	Almost Same Distance	2900	dfs-and-similar, graphs	377	8m 14s
G	Permutation Concatenation	3300	string-suffix-structures	139	1m 50s

Practice › Codeforces Solutions › Codeforces Global Round 6 ›

CF 1266E - Spaceship Solitaire

We are managing a production system with multiple resource types, where every turn normally produces exactly one unit of some chosen resource. The objective is to reach required target amounts for all resources, and we want to minimize the number of turns needed.

Practice › Codeforces Solutions › Codeforces Global Round 6 ›

CF 1266F - Almost Same Distance

We are given a tree with up to five hundred thousand vertices. For every possible distance value $k$, we want to pick a subset of vertices such that any two vertices inside the subset are very tightly structured: if you measure their shortest path distance in the tree, every…

Practice › Codeforces Solutions › Codeforces Global Round 6 ›

CF 1266G - Permutation Concatenation

We are asked to analyze a sequence formed by taking all permutations of the numbers from 1 to n, listing them in lexicographic order, and concatenating them into a single long array P. The question asks for the number of distinct contiguous subarrays in P.

Practice › Codeforces Solutions › Codeforces Global Round 6 ›

CF 1266C - Diverse Matrix

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

Practice › Codeforces Solutions › Codeforces Global Round 6 ›

CF 1266B - Dice Tower

The problem asks us to figure out whether it is possible to build a vertical tower of standard six-sided dice such that the sum of all visible pips equals a given integer. We have an unlimited number of dice, and for each die, we can choose its orientation.