IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2)
11 problems from IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) (contest 2061), difficulty 800-3500. 3/11 solutions verified against sample I/O.
IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2)
Div. 1+2 | 11 problems | 3/11 verified | Difficulty 800-3500 | 20m 29s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Kevin and Arithmetic | 800 | math | 22,350 | 3m 42s | ✓ |
| B | Kevin and Geometry | 1100 | binary-search, geometry | 14,689 | 1m 39s | |
| C | Kevin and Puzzle | 1600 | 2-sat, combinatorics, dp | 9,956 | 1m 49s | ✓ |
| D | Kevin and Numbers | 1600 | bitmasks, data-structures | 10,780 | 1m 38s | |
| E | Kevin and And | 2000 | bitmasks, brute-force, dp | 3,992 | 1m 42s | ✓ |
| F1 | Kevin and Binary String (Easy Version) | 2100 | greedy, implementation | 2,267 | 1m 43s | |
| F2 | Kevin and Binary String (Hard Version) | 3500 | data-structures, dp | 149 | 1m 48s | |
| G | Kevin and Teams | 2900 | constructive-algorithms, graphs, interactive | 494 | 1m 28s | |
| H1 | Kevin and Stones (Easy Version) | 3500 | flows, graph-matchings, graphs | 102 | 1m 32s | |
| H2 | Kevin and Stones (Hard Version) | 3500 | flows, graphs | 63 | 1m 40s | |
| I | Kevin and Nivek | 3500 | divide-and-conquer, dp | 122 | 1m 48s |
CF 2061I - Kevin and Nivek
We are asked to determine the minimum time Kevin must invest to win at least a given number of matches against Nivek, for all possible counts from 0 to $n$.
CF 2061H2 - Kevin and Stones (Hard Version)
We are given an undirected graph where each vertex may or may not contain a stone. Initially, some vertices are marked with stones, and we are also given a target configuration with the same number of stones.
CF 2061H1 - Kevin and Stones (Easy Version)
Kevin has a graph where each vertex may initially contain a stone or be empty. He also has a target configuration indicating where the stones need to end up.
CF 2061F2 - Kevin and Binary String (Hard Version)
We are given a binary string s consisting of 0s and 1s, and a target string t of the same length that can contain 0, 1, or the wildcard character ?. The operation allowed is to pick two adjacent blocks of identical characters in s and swap them.
CF 2061G - Kevin and Teams
We are given a set of $n$ people where every pair is either connected by a hidden binary relation, friendship or non-friendship. The relation is not known in advance, and in the interactive version it may even react to queries.
CF 2061F1 - Kevin and Binary String (Easy Version)
We are given two binary strings, s and t, of the same length. The string s can be modified using a single type of operation: swapping two adjacent blocks of identical characters.
CF 2061A - Kevin and Arithmetic
We are given several independent test cases. In each test case, we start with a running sum equal to zero and we are allowed to reorder the given list of numbers freely. After choosing an order, we process the numbers one by one.
CF 2061E - Kevin and And
We are given a list of integers a of length n and a list of magic integers b of length m. Kevin can choose up to k operations where each operation selects an element ai and a magic bj and replaces ai with ai & bj, the bitwise AND of the two numbers.
CF 2061D - Kevin and Numbers
We are given two sequences of integers: the initial sequence a of length n and the target sequence b of length m. Kevin can repeatedly take any two numbers from a whose difference is at most one, remove them, and insert their sum back into the sequence.
CF 2061C - Kevin and Puzzle
We have a line of classmates, each of whom claims a certain number of liars standing to their left. Each person is either honest, in which case their claim is exactly true, or a liar, in which case their claim may be arbitrary. Additionally, liars cannot stand next to each other.