Problem Link https://www.codechef.com/problems/ADDMUL
I wanted to understand how to handle addition and multiplication queries simultaneously. Though I read the editorial, I could not understand how to propagate lazy updates to the child nodes.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 164 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
Problem Link https://www.codechef.com/problems/ADDMUL
I wanted to understand how to handle addition and multiplication queries simultaneously. Though I read the editorial, I could not understand how to propagate lazy updates to the child nodes.
Can anyone explain me problem C ELECTRIFICATION from Educational Codeforces Round 66 (Rated for Div. 2). My doubts are from the tutorial are: 1. Since we need the dk+1 distance that means we should minimize distance to k+1 points so why we are looking over k points . 2. How they got the expression for f(x). The problem statement is https://mirror.codeforces.com/problemset/problem/1175/C and tutorial link is https://mirror.codeforces.com/blog/entry/67484
Название |
---|