Codeforces Round 683 (Div. 1, by Meet IT)

Solutions for Codeforces Round 683 (Div. 1, by Meet IT) (contest 1446). 3/7 problems verified against sample I/O. Difficulty range: 1300-3500.

7 items

Codeforces Round 683 (Div. 1, by Meet IT)

Type: Div. 1 | Problems: 7 | Verified: 3/7 | Rating range: 1300-3500 | Time: 18m 29s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Knapsack	1300	constructive-algorithms, greedy, sortings	1m 20s	✓
B	Catching Cheaters	1800	dp, strings	1m 46s	✗
C	Xor Tree	2100	binary-search, bitmasks, data-structures	5m 18s	✓
D1	Frequency Problem (Easy Version)	2600	data-structures, greedy	1m 35s	✗
D2	Frequency Problem (Hard Version)	3000	data-structures, greedy, two-pointers	1m 13s	✓
E	Long Recovery	3500	constructive-algorithms, dfs-and-similar	2m 3s	✗
F	Line Distance	3200	binary-search, data-structures, geometry	5m 14s	✗

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446F - Line Distance

We are given a set of points on the plane and asked to consider the line formed by every pair of points. For each line, we measure its perpendicular distance to the origin. The goal is to find the k-th smallest of all these distances.

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446C - Xor Tree

Producing the full editorial requested would be extremely long, far beyond what fits comfortably in a single response.

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446E - Long Recovery

The system describes an infinite triangular grid where every cell has exactly three neighbors. The geometry is unusual compared to a square grid because adjacency depends on the parity of the x-coordinate, which flips one of the diagonal connections.

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446D2 - Frequency Problem (Hard Version)

We are given an array of integers of length n. Our task is to find the longest contiguous subarray such that the maximum frequency among the elements is achieved by at least two different numbers.

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446D1 - Frequency Problem (Easy Version)

We are given an array of integers and asked to find the longest contiguous subarray where the most frequent value is tied, meaning there is no single dominant element.

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446B - Catching Cheaters

We have two essays represented as strings, and we want to find the most suspicious overlap between them. The overlap is measured using a similarity score defined as four times the length of the longest common subsequence of two substrings, minus the sum of their lengths.

Practice › Codeforces Solutions › Codeforces Round 683 (Div. 1, by Meet IT) ›

CF 1446A - Knapsack

We are given several independent test cases. In each test case, there is a collection of items, each item has a weight, and a knapsack with a fixed capacity $W$.