Interesting task on segment tree from virtual CF Educational 6. Again you see tree and queries in subtrees, so may be it is tin-tout ST… — Interesting task on segment tree from virtual CF Educational 6. Again you see tree and queries in subtrees, so may be it is tin-tout ST? Yes, it is. But here you should maintain info about ≤ 60 unique elements in each node and do lazy propagation. So may be merging…

It was a harsh day for me as I was very tired. So I don’t want to write a huge story today with descriptions of all tasks and their… — It was a harsh day for me as I was very tired. So I don’t want to write a huge story today with descriptions of all tasks and their solutions. Just some notes. I wrote Umnik’s Day 5 contest and Div. 3 on Codeforces. 5 + 5 problems AC. Div…

Today was an upsolving day. There were some tasks that had been implemented before, but hadn’t got AC. — Today was an upsolving day. There were some tasks that had been implemented before, but hadn’t got AC. One of these tasks is B from Umnik’s Day 3. The idea of solution came from his analysis. The problem is: you have an array h of length n and m queries…

07.07.2021 — Upsolving of Umnik’s Day 4 and Codeforces Div. 2 Round 730 — 07.07.2021 — Upsolving of Umnik’s Day 4 and Codeforces Div. 2 Round 730 Talking about round, 4 tasks were solved — A, B, C, D1 I was stupid a lot during the contest. D1 is very easy task, but I spent too much time. It could be solved much quicker…

Today was Day 3 of Umnik’s intensive. I solved 4 tasks on contest — A, F, I, N. And 1 task was upsolved — O. — Today was Day 3 of Umnik’s intensive. I solved 4 tasks on contest — A, F, I, N. And 1 task was upsolved — O. I rate myself low today as I were not efficient. In the first part of contest I missed 2 easy tasks — N and F…

I was too lazy to fill this blog by 1 story per day. So it will be story about three days of training. — I was too lazy to fill this blog by 1 story per day. So it will be story about three days of training. It was a contest on Codeforces on the 3rd of July. It was not very successful but result was descent, because I was fast enough. …

The most significant mistake of the whole contest was the fact that I did 11 submissions on problem O. That was some greedy idea with STL… — First day of Umnik’s summer intensive. I solved 5 tasks — A, C, D, K, O The most significant mistake of the whole contest was the fact that I did 11 submissions on problem O. That was some greedy idea with STL set or map, so it was O(nlogn) with…

I decided to start this blog to track my progress. — I decided to start this blog to track my progress. I started my day with Atcoder Beginner contest. I believe it was my most successful one as I stayed at 22th place at the moment I had all tasks being accepted. To be true tasks were easy and I spent…