CPMagical CP Library

Problem solution · Python

ABC185 F — Range Xor Query

ABC185 F — Range Xor Query: a Python solution using sliding window or two pointers. Learn the idea, check the complexity, and read the full code, with credit to KATO-Hiro AtCoder Solutions.

Technique
Sliding window or two pointers
Source
KATO-Hiro AtCoder Solutions
Length
60 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sliding window or two pointers

For ABC185 F — Range Xor Query, the implementation maintains a moving interval and updates only the information that enters or leaves the window.

  1. Choose the invariant that makes a window valid or useful.
  2. Advance the right boundary and add the new element.
  3. Move the left boundary only as needed while maintaining the invariant and updating the answer.

Code notes

  • 60 lines of Python from the credited upstream file abc185_f.py.
  • The implementation visibly relies on sequence storage, ordered lookup.
  • No explicit loop blocks detected.

Complexity

Confirm that neither pointer moves backwards; if so, the scan is usually linear apart from the window’s data-structure operations.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from KATO-Hiro AtCoder Solutions by KATO-Hiro and is used under the CC0-1.0 licence.

Open problem ↗Original source ↗
Full codeABC185 F — Range Xor Query · PythonPython
Use this to learn the idea, then write your own version.
# -*- coding: utf-8 -*-  import typing  class FenwickTree:    """Reference: https://en.wikipedia.org/wiki/Fenwick_tree"""     def __init__(self, n: int = 0) -> None:        self._n = n        self.data = [0] * n     def add(self, p: int, x: typing.Any) -> None:        assert 0 <= p < self._n         p += 1        while p <= self._n:            self.data[p - 1] ^= x            p += p & -p     def sum(self, left: int, right: int) -> typing.Any:        assert 0 <= left <= right <= self._n         return self._sum(right) ^ self._sum(left)     def _sum(self, r: int) -> typing.Any:        s = 0        while r > 0:            s ^= self.data[r - 1]            r -= r & -r         return s  def main():    import sys     input = sys.stdin.readline     n, q = map(int, input().split())    a = list(map(int, input().split()))    bit = FenwickTree(n)     for index, ai in enumerate(a):        bit.add(index, ai)     for i in range(q):        ti, xi, yi = map(int, input().split())         if ti == 1:            bit.add(xi - 1, yi)        else:            summed = bit.sum(xi - 1, yi)            print(summed)  if __name__ == "__main__":    main()

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗