Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT

Solutions for Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT (contest 1763). 1/6 problems verified against sample I/O. Difficulty range: 800-3000.

6 items

Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-3000 | Time: 22m 3s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Absolute Maximization	800	bitmasks, constructive-algorithms, greedy	2m 30s	✓
B	Incinerate	1200	binary-search, brute-force, data-structures	11m 11s	✗
C	Another Array Problem	2000	brute-force, constructive-algorithms, greedy	2m 40s	✗
D	Valid Bitonic Permutations	2200	combinatorics, dp, implementation	1m 10s	✗
E	Node Pairs	2200	dp, graphs, math	3m 51s	✗
F	Edge Queries	3000	data-structures, dfs-and-similar, dp	41s	✗

Practice › Codeforces Solutions › Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT ›

CF 1763B - Incinerate

We are fighting a set of monsters. Every monster has a health value and a power value. Genos repeatedly performs attacks. If the current attack strength is k, every monster that is still alive loses k health simultaneously.

Practice › Codeforces Solutions › Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT ›

CF 1763E - Node Pairs

We are given a directed graph on an unknown number of vertices. The graph is required to satisfy a structural condition: among all ordered pairs of vertices, there are exactly (p) pairs ((u,v)) with (u < v) such that both vertices can reach each other.

Practice › Codeforces Solutions › Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT ›

CF 1763F - Edge Queries

Codeforces 1763F: Edge Queries

Practice › Codeforces Solutions › Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT ›

CF 1763D - Valid Bitonic Permutations

We are asked to count the number of permutations of the numbers from 1 to n that are bitonic and satisfy two fixed positions. A bitonic permutation is one that strictly increases up to a certain peak index, then strictly decreases afterward.

Practice › Codeforces Solutions › Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT ›

CF 1763C - Another Array Problem

We are given an array of integers, and we are allowed to repeatedly apply a very specific transformation: pick two positions $i < j$, compute the absolute difference of the values at the ends, and overwrite the entire segment $[i, j]$ with that single value.

Practice › Codeforces Solutions › Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT ›

CF 1763A - Absolute Maximization

We have an array of integers. An operation allows us to pick any two positions and a bit index, then swap the values of that bit between the two numbers. The crucial detail is that the bit position is fixed during a swap.