(self, l, r, inc, node=None)
| 18 | self.root = Node(1, int(1e5 + 1)) |
| 19 | |
| 20 | def modifyAdd(self, l, r, inc, node=None): |
| 21 | if l > r: |
| 22 | return |
| 23 | if node is None: |
| 24 | node = self.root |
| 25 | if node.l >= l and node.r <= r: |
| 26 | node.v = (node.v + (node.r - node.l + 1) * inc) % MOD |
| 27 | node.add += inc |
| 28 | return |
| 29 | self.pushdown(node) |
| 30 | if l <= node.mid: |
| 31 | self.modifyAdd(l, r, inc, node.left) |
| 32 | if r > node.mid: |
| 33 | self.modifyAdd(l, r, inc, node.right) |
| 34 | self.pushup(node) |
| 35 | |
| 36 | def modifyMul(self, l, r, m, node=None): |
| 37 | if l > r: |