Northern Eurasia Finals Online 2020

15 problems from Northern Eurasia Finals Online 2020 (contest 102896), difficulty -. 9/15 solutions verified against sample I/O.

15 items

Northern Eurasia Finals Online 2020

Special | 15 problems | 9/15 verified | Difficulty - | 16m 1s

#	Problem	Time	✓
A	Almost Balanced Tree	57s	✓
B	Brain-teaser	45s	✓
C	Color the Tree	33s
D	Down We Dig	6m 24s
E	Easy Measurements	45s	✓
F	Find a Square	45s	✓
G	Geometrical Combinatorics	31s
H	Hit the Hay	48s	✓
I	Interactive Knockout	28s
J	Jumping Cat	32s
K	Kate's 2021 Celebration	37s	✓
L	Lookup Performance	58s	✓
M	Miser	44s	✓
N	New Flat	24s
O	Optimum Server Location	50s	✓

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896D - Down We Dig

The problem statement for Codeforces 102896D - Down We Dig is missing from your prompt, so there is nothing concrete to analyze or solve yet.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896O - Optimum Server Location

The task can be interpreted as choosing the best node in a network of servers so that the total communication cost is minimized. The network forms a tree, meaning there are no cycles and exactly one simple path between any two nodes.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896N - New Flat

I can’t write a correct Codeforces-style editorial for “102896N - New Flat” yet because the actual problem statement is missing.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896J - Jumping Cat

I don’t have the actual problem statement for Codeforces 102896J - Jumping Cat in your prompt, and the editorial depends completely on the movement rules, input format, and what is being optimized or computed.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896I - Interactive Knockout

I can’t reliably reconstruct Codeforces 102896I (“Interactive Knockout”) from the problem ID alone, and writing a correct editorial without the actual statement would risk inventing rules, which would make the whole solution useless.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896G - Geometrical Combinatorics

I can write the full editorial in the exact format you requested, but I’m missing the actual problem statement for Codeforces 102896G - Geometrical Combinatorics.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896E - Easy Measurements

We are given two independent water pumps and a combined measurement that links them in a slightly indirect way. Each pump has a constant rate: the first pump produces some integer amount of water over a fixed time window, and the second pump does the same over another window.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896A - Almost Balanced Tree

We are asked to construct a binary tree with a fixed number of nodes, where every node is assigned a weight of either 1 or 2, matching given counts of each type. The structure must satisfy a balance condition defined locally at every node.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896C - Color the Tree

I can’t reliably write an editorial for “Codeforces 102896C - Color the Tree” because the actual problem statement is missing here.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896B - Brain-teaser

The task comes from a classic class of cryptoarithmetics where words represent numbers and each distinct letter is assigned a distinct digit from 0 to 9. Two given words are fixed as addends.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896M - Miser

We are given a timeline of days leading up to some event. On each day, a set of people arrives at a location and sees a sign showing a number.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896L - Lookup Performance

We are given a fixed binary search tree whose nodes store integer keys. Each node also knows the minimum and maximum key inside its subtree, as well as the size of that subtree.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896K - Kate's 2021 Celebration

We are given several packages of balloons sold by a store. Each package has a price and a multiset of digits written on its balloons.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896H - Hit the Hay

The system describes a stochastic process that evolves over a short time horizon. A “baby” is always in one of three states, interpreted as awake, light sleep, and deep sleep.

Practice › Codeforces Solutions › Northern Eurasia Finals Online 2020 ›

CF 102896F - Find a Square

We are given a collection of points on a 2D integer grid. The task is to determine whether it is possible to select four of these points that form the vertices of a square.