📌  相关文章
📜  使用Fenwick树对给定范围内的元素进行XOR与更新

📅  最后修改于: 2021-05-25 06:20:32             🧑  作者: Mango

给定一个由整数组成的数组A []和由以下两种类型的查询组成的数组Q

  • (1,L,R) :返回存在于索引LR之间的所有元素的XOR。
  • (2,I,val)将A [I]更新为A [I] XOR val

任务是使用Fenwick树解决每个查询并为第一种类型的每个查询打印XOR。
例子:

方法:

  • 对于类型1的查询,使用getXor()返回范围[1,R]和范围[1,L-1]中的元素的Xor。
  • 在getXor()中,对于i从其索引开始到其所有祖先,一直使用BITree [i]计算XOR 。为了在getXor()视图中获得第i个索引的祖先,我们只需要从i中减去i = i – i&(-i)的LSB(最低有效位)即可。最后返回最终的XOR值。
  • 对于类型2的查询,将A [index]更新为A [index] ^ val 。通过调用updateBIT()更新BITree []中包含此元素的所有范围。
  • 在updateBIT(),对于每一个i。指数为所有的祖先开始到N,更新BITree [I]作为BITree [I] ^ VAL。为了在updateBit()视图中获得第i个索引的祖先,我们只需要通过i = i + i&(-i)从i添加LSB(最低有效位)

下面是上述方法的实现:

C++
// C++ Program to find XOR of
// elements in given range [L, R].
 
#include 
using namespace std;
 
// Returns XOR of arr[0..index].
// This function assumes that the
// array is preprocessed and partial
// XORs of array elements are stored
// in BITree[].
int getXOR(int BITree[], int index)
{
    int ans = 0;
    index += 1;
 
    // Traverse ancestors
    // of BITree[index]
    while (index > 0) {
 
        // XOR current element
        // of BIT to ans
        ans ^= BITree[index];
 
        // Update index to that
        // of the parent node in
        // getXor() view by
        // subtracting LSB(Least
        // Significant Bit)
        index -= index & (-index);
    }
    return ans;
}
 
// Updates the Binary Index Tree by
// replacing all ancestores of index
// by their respective XOR with val
void updateBIT(int BITree[], int n,
               int index, int val)
{
    index = index + 1;
 
    // Traverse all ancestors
    // and XOR with 'val'.
    while (index <= n) {
 
        // XOR 'val' to current
        // node of BIT
        BITree[index] ^= val;
 
        // Update index to that
        // of the parent node in
        // updateBit() view by
        // adding LSB(Least
        // Significant Bit)
        index += index & (-index);
    }
}
 
// Constructs and returns a Binary
// Indexed Tree for the given array
int* constructBITree(int arr[], int n)
{
    // Create and initialize
    // the Binary Indexed Tree
    int* BITree = new int[n + 1];
    for (int i = 1; i <= n; i++)
        BITree[i] = 0;
 
    // Store the actual values in
    // BITree[] using update()
    for (int i = 0; i < n; i++)
        updateBIT(BITree, n, i, arr[i]);
 
    return BITree;
}
 
int rangeXor(int BITree[], int l, int r)
{
    return getXOR(BITree, r)
           ^ getXOR(BITree, l - 1);
}
 
// Driver Code
int main()
{
    int A[] = { 2, 1, 1, 3, 2, 3,
                4, 5, 6, 7, 8, 9 };
    int n = sizeof(A) / sizeof(A[0]);
 
    vector > q
        = { { 1, 0, 9 },
            { 2, 3, 6 },
            { 2, 5, 5 },
            { 2, 8, 1 },
            { 1, 0, 9 } };
 
    // Create the Binary Indexed Tree
    int* BITree = constructBITree(A, n);
 
    // Solve each query in Q
    for (int i = 0; i < q.size(); i++) {
        int id = q[i][0];
 
        if (id == 1) {
            int L = q[i][1];
            int R = q[i][2];
            cout << "XOR of elements "
                 << "in given range is "
                 << rangeXor(BITree, L, R)
                 << "\n";
        }
        else {
            int idx = q[i][1];
            int val = q[i][2];
            A[idx] ^= val;
 
            // Update the values of all
            // ancestors of idx
            updateBIT(BITree, n, idx, val);
        }
    }
 
    return 0;
}


Java
// Java Program to find XOR of
// elements in given range [L, R].
import java.util.*;
 
class GFG{
 
// Returns XOR of arr[0..index].
// This function assumes that the
// array is preprocessed and partial
// XORs of array elements are stored
// in BITree[].
static int getXOR(int BITree[], int index)
{
    int ans = 0;
    index += 1;
 
    // Traverse ancestors
    // of BITree[index]
    while (index > 0)
    {
 
        // XOR current element
        // of BIT to ans
        ans ^= BITree[index];
 
        // Update index to that
        // of the parent node in
        // getXor() view by
        // subtracting LSB(Least
        // Significant Bit)
        index -= index & (-index);
    }
    return ans;
}
 
// Updates the Binary Index Tree by
// replacing all ancestores of index
// by their respective XOR with val
static void updateBIT(int BITree[], int n,
                      int index, int val)
{
    index = index + 1;
 
    // Traverse all ancestors
    // and XOR with 'val'.
    while (index <= n)
    {
 
        // XOR 'val' to current
        // node of BIT
        BITree[index] ^= val;
 
        // Update index to that
        // of the parent node in
        // updateBit() view by
        // adding LSB(Least
        // Significant Bit)
        index += index & (-index);
    }
}
 
// Constructs and returns a Binary
// Indexed Tree for the given array
static int[] constructBITree(int arr[], int n)
{
    // Create and initialize
    // the Binary Indexed Tree
    int []BITree = new int[n + 1];
    for (int i = 1; i <= n; i++)
        BITree[i] = 0;
 
    // Store the actual values in
    // BITree[] using update()
    for (int i = 0; i < n; i++)
        updateBIT(BITree, n, i, arr[i]);
 
    return BITree;
}
 
static int rangeXor(int BITree[], int l, int r)
{
    return getXOR(BITree, r) ^
           getXOR(BITree, l - 1);
}
 
// Driver Code
public static void main(String[] args)
{
    int A[] = { 2, 1, 1, 3, 2, 3,
                4, 5, 6, 7, 8, 9 };
    int n = A.length;
 
    int [][]q = { { 1, 0, 9 },
                  { 2, 3, 6 },
                  { 2, 5, 5 },
                  { 2, 8, 1 },
                  { 1, 0, 9 } };
 
    // Create the Binary Indexed Tree
    int []BITree = constructBITree(A, n);
 
    // Solve each query in Q
    for (int i = 0; i < q.length; i++)
    {
        int id = q[i][0];
 
        if (id == 1)
        {
            int L = q[i][1];
            int R = q[i][2];
            System.out.print("XOR of elements " +
                           "in given range is " +
                         rangeXor(BITree, L, R) + "\n");
        }
        else
        {
            int idx = q[i][1];
            int val = q[i][2];
            A[idx] ^= val;
 
            // Update the values of all
            // ancestors of idx
            updateBIT(BITree, n, idx, val);
        }
    }
}
}
 
// This code is contributed by Princi Singh


Python3
# Python3 program to find XOR of
# elements in given range [L, R].
 
# Returns XOR of arr[0..index].
# This function assumes that the
# array is preprocessed and partial
# XORs of array elements are stored
# in BITree[].
def getXOR(BITree, index):
 
    ans = 0
    index += 1
 
    # Traverse ancestors
    # of BITree[index]
    while (index > 0):
     
        # XOR current element
        # of BIT to ans
        ans ^= BITree[index]
 
        # Update index to that
        # of the parent node in
        # getXor() view by
        # subtracting LSB(Least
        # Significant Bit)
        index -= index & (-index)
     
    return ans
 
# Updates the Binary Index Tree by
# replacing all ancestores of index
# by their respective XOR with val
def updateBIT(BITree, n, index, val):
 
    index = index + 1
 
    # Traverse all ancestors
    # and XOR with 'val'.
    while (index <= n):
     
        # XOR 'val' to current
        # node of BIT
        BITree[index] ^= val
 
        # Update index to that
        # of the parent node in
        # updateBit() view by
        # adding LSB(Least
        # Significant Bit)
        index += index & (-index)
     
# Constructs and returns a Binary
# Indexed Tree for the given array
def constructBITree(arr, n):
 
    # Create and initialize
    # the Binary Indexed Tree
    BITree = [0] * (n + 1)
     
    # Store the actual values in
    # BITree[] using update()
    for i in range(n):
        updateBIT(BITree, n, i, arr[i])
 
    return BITree
 
def rangeXor(BITree, l, r):
 
    return (getXOR(BITree, r) ^
            getXOR(BITree, l - 1))
            
# Driver Code
if __name__ == "__main__":
     
    A = [ 2, 1, 1, 3, 2, 3,
          4, 5, 6, 7, 8, 9 ]
    n = len(A)
 
    q = [ [ 1, 0, 9 ], [ 2, 3, 6 ],
          [ 2, 5, 5 ], [ 2, 8, 1 ],
          [ 1, 0, 9 ] ]
 
    # Create the Binary Indexed Tree
    BITree = constructBITree(A, n)
 
    # Solve each query in Q
    for i in range(len(q)):
        id = q[i][0]
 
        if (id == 1):
            L = q[i][1]
            R = q[i][2]
            print("XOR of elements in "
                  "given range is ",
                  rangeXor(BITree, L, R))
        else:
            idx = q[i][1]
            val = q[i][2]
            A[idx] ^= val
 
            # Update the values of all
            # ancestors of idx
            updateBIT(BITree, n, idx, val)
 
# This code is contributed by jana_sayantan


C#
// C# program to find XOR of
// elements in given range [L, R].
using System;
 
class GFG{
 
// Returns XOR of arr[0..index].
// This function assumes that the
// array is preprocessed and partial
// XORs of array elements are stored
// in BITree[].
static int getXOR(int []BITree, int index)
{
    int ans = 0;
    index += 1;
 
    // Traverse ancestors
    // of BITree[index]
    while (index > 0)
    {
 
        // XOR current element
        // of BIT to ans
        ans ^= BITree[index];
 
        // Update index to that
        // of the parent node in
        // getXor() view by
        // subtracting LSB(Least
        // Significant Bit)
        index -= index & (-index);
    }
    return ans;
}
 
// Updates the Binary Index Tree by
// replacing all ancestores of index
// by their respective XOR with val
static void updateBIT(int []BITree, int n,
                      int index, int val)
{
    index = index + 1;
 
    // Traverse all ancestors
    // and XOR with 'val'.
    while (index <= n)
    {
 
        // XOR 'val' to current
        // node of BIT
        BITree[index] ^= val;
 
        // Update index to that
        // of the parent node in
        // updateBit() view by
        // adding LSB(Least
        // Significant Bit)
        index += index & (-index);
    }
}
 
// Constructs and returns a Binary
// Indexed Tree for the given array
static int[] constructBITree(int []arr,
                             int n)
{
     
    // Create and initialize
    // the Binary Indexed Tree
    int []BITree = new int[n + 1];
    for(int i = 1; i <= n; i++)
       BITree[i] = 0;
 
    // Store the actual values in
    // BITree[] using update()
    for(int i = 0; i < n; i++)
       updateBIT(BITree, n, i, arr[i]);
 
    return BITree;
}
 
static int rangeXor(int []BITree, int l,
                                  int r)
{
    return getXOR(BITree, r) ^
           getXOR(BITree, l - 1);
}
 
// Driver Code
public static void Main(String[] args)
{
    int []A = { 2, 1, 1, 3, 2, 3,
                4, 5, 6, 7, 8, 9 };
    int n = A.Length;
     
    int [,]q = { { 1, 0, 9 },
                 { 2, 3, 6 },
                 { 2, 5, 5 },
                 { 2, 8, 1 },
                 { 1, 0, 9 } };
 
    // Create the Binary Indexed Tree
    int []BITree = constructBITree(A, n);
 
    // Solve each query in Q
    for(int i = 0; i < q.GetLength(0); i++)
    {
       int id = q[i, 0];
        
       if (id == 1)
       {
           int L = q[i, 1];
           int R = q[i, 2];
           Console.Write("XOR of elements " +
                       "in given range is " +
                     rangeXor(BITree, L, R) + "\n");
       }
       else
       {
           int idx = q[i, 1];
           int val = q[i, 2];
           A[idx] ^= val;
            
           // Update the values of
           // all ancestors of idx
           updateBIT(BITree, n, idx, val);
       }
    }
}
}
 
// This code is contributed by sapnasingh4991


Javascript


输出:
XOR of elements in given range is 0
XOR of elements in given range is 2

getXor()的时间复杂度: O(log N)
updateBIT()的时间复杂度: O(log N)
总时间复杂度: O(M * log N),其中M和N分别是查询数和给定数组的大小。

如果您希望与行业专家一起参加现场课程,请参阅《 Geeks现场课程》和《 Geeks现场课程美国》。