Our team of isaf27, Maksim1744 and me had prepared a contest for Petrozavodsk camp some time ago.

Contest link

We hoped to use this contest for some open competition, like opencup or universal cup, but it seems like it already became well known in China.

The difficulty of the contest is higher than average, and we hope that strong teams like USA1 and japan02 can enjoy it too (if they have spare time).

We thank

• pinely for supporting our efforts
• snarknews for his help in growing and improving ICPC community
• universal cup team for continuing these efforts
• MikeMirzayanov for an opportunity for self improvement for many people, by providing great platforms Codeforces and Polygon

I'm trying to find some article or at least a name of some type of bipartite graph, description follows.

• Left part contains exactly $$$n$$$ nodes, numbered $$$1$$$ through $$$n$$$.

• Right part contains $$$m$$$ nodes, each node is associated with a segment $$$[l; r]$$$, where $$$1 \le l \le r \le n$$$.

• There is an edge $$$(i, j)$$$ iff $$$l_j \le i \le r_j$$$.

It seems natural to call such graph as a bipartite line graph, but there is another (apparently more popular) graph called line graph, which has nothing to do with mine.

One thing to mention is that this graph is considered by me in terms of flows, so probably it is considered in such context in science too.

If someone knows it's name, or even saw an article mentioning it, I would be very grateful to that person for sharing this information!

I'm unable to find any resources(with some proofs) on how to find certificate for lambda(a.k.a. Lagrange) dp optimization for non-strict convex functions. Any help is highly appreciated!

Hello, I was solving golf from JOI 2017 Open. I tested in polygon with author's solution. My solution got WA, then I decided to change C++17 to C++14 and magically I've got AC. Can someone tell me how is that possible. Also I submitted it to oj.uz where compiler is under Ubuntu and it also gives wrong answer code test

Дано 4 массива A, P и B, Q размеров N и M запросов. Изначально, элементы A и B равны 0, и элементы P и Q отсортированы в неубывающем порядке и имеют ограничения 0 ≤ x ≤ 10⁹.

Существует 3 типа операций:

• 0 ≤ x ≤ 10⁹; 1 ≤ i ≤ N; A_i = x
• 0 ≤ x ≤ 10⁹; 1 ≤ i ≤ N; B_i = x
• 0 ≤ x ≤ 10⁹; 1 ≤ y ≤ 10¹⁸; Найти минимальное i, такое что выполняется

Существует простое решение, работающее за O(Nlog²N): хранить A и B в дереве Фенвика, когда нужно ответить на запрос, сделать бинарный поиск по i, и проверить, выполняется ли неравенство. Я хочу выяснить, существует ли решение за O(NlogN). Помогите с решением этой проблемы.

Hello Codeforces!

I’d like you to invite for CodeChef June Lunchtime that will start at 19:30 IST of 24-th June 2017 (check your time zone here) and will last 3 hours.

The author of problems is me, never_giveup, while Lewin is a tester and mareksom is the secondary Tester. The editorialist is pkacprzak. Translators: CherryTree (Russian), huzecong (Mandarin) and VNOI team (Vietnamese).

There is no registration required, anybody with a CodeChef handle can participate. Top school participants can win CodeChef laddus (details on the contest page).

You will be provided 4 problems with subtasks (IOI-style grading). Ties are broken by time of reaching your final score.

Remember about subtasks if you can't solve a problem for the full score, and read the editorial after the contest.