Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4)
4 problems from Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) (contest 1276), difficulty 1400-3400. 2/4 solutions verified against sample I/O.
Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4)
Div. 1 | 4 problems | 2/4 verified | Difficulty 1400-3400 | 21m 23s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | As Simple as One and Two | 1400 | dp, greedy | 12,947 | 5m 49s | |
| B | Two Fairs | 1900 | combinatorics, dfs-and-similar, dsu | 5,668 | 1m 34s | ✓ |
| C | Beautiful Rectangle | 2300 | brute-force, combinatorics, constructive-algorithms | 1,788 | 11m 51s | |
| F | Asterisk Substrings | 3400 | string-suffix-structures | 447 | 2m 9s | ✓ |
CF 1276C - Beautiful Rectangle
We are given a multiset of integers, and we are allowed to select some of them and arrange the selected elements into a rectangular grid. Every chosen element occupies exactly one cell, and the grid is completely filled with chosen values.
CF 1276A - As Simple as One and Two
We are given a string consisting of lowercase letters. Certain length-3 patterns are considered “bad”: specifically, the substrings "one" and "two". A string becomes unacceptable if any such bad triple appears anywhere inside it.
CF 1276F - Asterisk Substrings
We are given a string s consisting of lowercase English letters, and we want to count all distinct substrings that appear in s or in any version of s where exactly one character has been replaced by an asterisk.