Codeforces Round 794 (Div. 2)

Solutions for Codeforces Round 794 (Div. 2) (contest 1686). 2/2 problems verified against sample I/O. Difficulty range: 800-800.

2 items

Codeforces Round 794 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-800 | Time: 3m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Everything Everywhere All But One	800	greedy	1m 35s	✓
B	Odd Subarrays	800	dp, greedy	1m 42s	✓

Practice › Codeforces Solutions › Codeforces Round 794 (Div. 2) ›

CF 1686B - Odd Subarrays

We are given a permutation of the numbers from 1 to n. We may split this permutation into any number of consecutive pieces. Each piece is a subarray. For every subarray, we look at its inversion count. A subarray is called odd if its inversion count is odd.

Practice › Codeforces Solutions › Codeforces Round 794 (Div. 2) ›

CF 1686A - Everything Everywhere All But One

We are given several independent test cases. Each test case starts with an array of integers. The only operation allowed transforms the array in a very specific way: we pick exactly one element to leave untouched and replace every other element by the average of the chosen group.