Given an integer array Arr[] of length N and an array Queries[] of length Q where Queries[i] = [valuei, indexi]. For each query i, update Arr[indexi] = Arr[indexi] + valuei, then print the sum of the all the odd values of Arr[].
Examples:
Input: N = 4, Arr = [1,2,3,5], Q = 4, Queries = [[1,0],[-3,1],[-4,0],[2,3]]
Output: 8 7 7 9
Explanation: At the beginning, the array is [1,2,3,5].
After adding 1 to Arr[0], the array is [2,2,3,5], and the sum of odd values is 3 + 5 = 8.
After adding -3 to Arr[1], the array is [2,-1,3,5], and the sum of odd values is -1 + 3 + 5 = 7.
After adding -4 to Arr[0], the array is [-2,-1,3,5], and the sum of odd values is -1 + 3 + 5 = 7.
After adding 2 to Arr[3], the array is [-2,-1,3,7], and the sum of odd values is -1 + 3 + 7 = 9.Input: N = 1 , Arr = [1], Q = 1,Queries = [[4,0]]
Output: [5]
Explanation: At the beginning, the array is [1].
After adding 4 to Arr[0], the array is [5], and the sum of odd values is 0.
Naive Approach: The problem can be solved by implementing the operations as mentioned.
For each query first update the value and then iterate through the array to find the sum of odd integers.
Follow the steps mentioned below to implement the idea:
- Declare the answer array.
- Run a loop form j = 0 to Q-1:
- Increment arr[idx] (where idx is the index mentioned in the query) by the given value in the query.
- Initialize the sum to 0.
- Run a nested loop from i = 0 to N-1:
- If the element is odd, then add that value to the sum.
- Add the sum to the answer array.
- Print the answer array.
Below is the implementation of the above approach.
C++
// C++ code to implement the approach#include <bits/stdc++.h>using namespace std;// Function performing calculationsvector<int> Sumodd(int N, int Arr[], int Q, int Queries[][2]){ // Declaring the answer array vector<int> ans; for (int j = 0; j < Q; j++) { // Incrementing the array element // for every query Arr[Queries[j][1]] += Queries[j][0]; // Initializing sum variable to int sum = 0; for (int i = 0; i < N; i++) { // If the element is odd then // increment the sum if (Arr[i] % 2 == 1 || Arr[i] % 2 == -1) { sum += Arr[i]; } } // Pushing result of every query ans.push_back(sum); } // Return the answer array return ans;}// Driver codeint main(){ int Arr[] = { 1, 2, 3, 5 }; int N = sizeof(Arr) / sizeof(Arr[0]); int Q = 4; int Queries[Q][2] = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call vector<int> ans = Sumodd(N, Arr, Q, Queries); for (int x : ans) cout << x << " "; return 0;} |
Java
// Java code to implement the approachimport java.io.*;import java.util.*;class GFG { // Function performing calculations public static ArrayList<Integer> Sumodd(int N, int Arr[], int Q, int Queries[][]) { // Declaring the answer arraylist ArrayList<Integer> ans = new ArrayList<Integer>(); for (int j = 0; j < Q; j++) { // Incrementing the array element // for every query Arr[Queries[j][1]] += Queries[j][0]; // Initializing sum variable to int sum = 0; for (int i = 0; i < N; i++) { // If the element is odd then // increment the sum if (Arr[i] % 2 == 1 || Arr[i] % 2 == -1) { sum += Arr[i]; } } // Pushing result of every query ans.add(sum); } // Return the answer array return ans; } // Driver Code public static void main(String[] args) { int Arr[] = { 1, 2, 3, 5 }; int N = Arr.length; int Q = 4; int Queries[][] = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call ArrayList<Integer> ans = Sumodd(N, Arr, Q, Queries); for (int x : ans) System.out.print(x + " "); }}// This code is contributed by Rohit Pradhan |
Python3
# Python program for the above approach# Function performing calculationsdef Sumodd(N, Arr, Q, Queries): # Declaring the answer arraylist ans = [] for j in range(Q): # Incrementing the array element for every query Arr[Queries[j][1]] += Queries[j][0] # Initializing sum variable to 0 Sum = 0 for i in range(N): # If the element is odd then increment the sum if(Arr[i] % 2 is 1 or Arr[i] % 2 is -1): Sum += Arr[i] # Pushing result of every query ans.append(Sum) # Return the answer array return ansArr = [1, 2, 3, 5]N = len(Arr)Q = 4Queries = [[1, 0], [-3, 1], [-4, 0], [2, 3]]# Function callans = Sumodd(N, Arr, Q, Queries)for x in range(len(ans)): print(ans[x], end=" ")# This code is contributed by lokeshmvs21. |
C#
// C# implementationusing System;public class HelloWorld{ // Function performing calculations static int[] Sumodd(int N, int[] Arr, int Q, int[,] Queries) { // Declaring the answer array int[] ans=new int[Q]; for (int j = 0; j < Q; j++) { // Incrementing the array element // for every query Arr[Queries[j,1]] += Queries[j,0]; // Initializing sum variable to int sum = 0; for (int i = 0; i < N; i++) { // If the element is odd then // increment the sum if (Arr[i] % 2 == 1 || Arr[i] % 2 == -1) { sum += Arr[i]; } } // Pushing result of every query ans[j]=(sum); } // Return the answer array return ans; } public static void Main(string[] args) { int[] Arr = { 1, 2, 3, 5 }; int N = Arr.Length; int Q = 4; int[,] Queries = new int[4,2]{ { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call int[] ans = Sumodd(N, Arr, Q, Queries); for (int x = 0; x < ans.Length; x++){ Console.Write(ans[x] + " "); } }}// This code is contributed by ksam24000 |
Javascript
<script>// JavaScript program for the above approach // Function performing calculations function Sumodd(N, Arr, Q, Queries) { // Declaring the answer arraylist let ans = []; for (let j = 0; j < Q; j++) { // Incrementing the array element // for every query Arr[Queries[j][1]] += Queries[j][0]; // Initializing sum variable to let sum = 0; for (let i = 0; i < N; i++) { // If the element is odd then // increment the sum if (Arr[i] % 2 == 1 || Arr[i] % 2 == -1) { sum += Arr[i]; } } // Pushing result of every query ans.push(sum); } // Return the answer array return ans; }// Driver Code let Arr = [ 1, 2, 3, 5 ]; let N = Arr.length; let Q = 4; let Queries = [[ 1, 0 ], [ -3, 1 ], [ -4, 0 ], [ 2, 3 ]]; // Function call let ans = Sumodd(N, Arr, Q, Queries); for (let x in ans) document.write(ans[x] + " ");// This code is contributed by sanjoy_62.</script> |
Output
8 7 7 9
Time Complexity: O(Q*N).
Auxiliary Space: O(Q) i.e answer array of Q size.
Efficient Approach using Precomputation:
The problem can be solved using precomputation based on the following observation:
Say the sum of odd elements was S before performing an update query. So, for update query, there can be four cases:
- Element changes from odd to odd: In this case the sum increases by value (where value is the amount needed to be updated as per the query). This can be interpreted as subtracting the previous value from S and then adding the new updated value.
- Element changes from even to odd: In this case the increase in sum is the same as the new odd value.
- Element changes from odd to even: In this case the sum decreases by an amount same as the previous value of the element.
- Element changes from even to even: In this case there is no change in sum.
So we can see that whenever the element was odd before update, initially there is a decrement in the sum and if the new updated value is odd, there is an increment of that amount in S.
Follow the steps mentioned below to implement the idea:
- Declare the answer array.
- Iterate throughout the array and calculate the sum of the odd values.
- Run a loop from j = 0 to Q-1:
- Store the previous value of Arr[indexj] in temp variable.
- If the temp value is odd then decrement the sum by temp.
- Incrementing the value Arr[indexj] by valuej and update temp.
- If the temp value is odd then increment the sum by temp.
- Push the sum into the answer array.
- Print the answer array.
Below is the implementation of the above approach.
C++
// C++ code to implement the approach#include <bits/stdc++.h>using namespace std;// Function performing calculations.vector<int> Sumodd(int N, int Arr[], int Q, int Queries[][2]){ // Declaring the answer array vector<int> ans; // Initializing the sum variable to 0. int sum = 0; for (int i = 0; i < N; i++) { // Loop to precomputing // the sum of odd elements if (Arr[i] % 2 != 0) { sum += Arr[i]; } } for (int j = 0; j < Q; j++) { int temp = Arr[Queries[j][1]]; // If the element was odd then // decrement it from the sum if (temp % 2 != 0) { sum -= temp; } // Update the array element for every query Arr[Queries[j][1]] += Queries[j][0]; temp = Arr[Queries[j][1]]; // If the updated value of temp is odd // then increment the sum if (temp % 2 != 0) { sum += temp; } // Push result of every query ans.push_back(sum); } // Return the answer array return ans;}// Driver codeint main(){ int Arr[] = { 1, 2, 3, 5 }; int N = sizeof(Arr) / sizeof(Arr[0]); int Q = 4; int Queries[Q][2] = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call vector<int> ans = Sumodd(N, Arr, Q, Queries); for (int x : ans) cout << x << " "; return 0;} |
Java
// Java code to implement the approachimport java.io.*;import java.util.*;class GFG { // Function performing calculations static List<Integer> Sumodd(int N, int[] Arr, int Q, int[][] Queries) { // Declaring the answer array List<Integer> ans = new ArrayList<>(); // Initializing the sum variable to 0. int sum = 0; for (int i = 0; i < N; i++) { // Loop to precomputing // the sum of odd elements if (Arr[i] % 2 != 0) { sum += Arr[i]; } } for (int j = 0; j < Q; j++) { int temp = Arr[Queries[j][1]]; // If the element was odd then // decrement it from the sum if (temp % 2 != 0) { sum -= temp; } // Update the array element for every query Arr[Queries[j][1]] += Queries[j][0]; temp = Arr[Queries[j][1]]; // If the updated value of temp is odd // then increment the sum if (temp % 2 != 0) { sum += temp; } // Push result of every query ans.add(sum); } // Return the answer array return ans; } public static void main(String[] args) { int[] Arr = { 1, 2, 3, 5 }; int N = Arr.length; int Q = 4; int[][] Queries = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call List<Integer> ans = Sumodd(N, Arr, Q, Queries); for (int i = 0; i < ans.size(); i++) { System.out.print(ans.get(i) + " "); } }}// This code is contributed by lokeshmvs21. |
Python3
# Python code to implement the approach# Function performing calculationsdef Sumodd(N, Arr, Q, Queries): # Declaring the answer array ans = [] # Initializing the sum variable to 0. Sum = 0 for i in range(N): # Loop to precomputing # the sum of odd elements if(Arr[i] % 2 != 0): Sum += Arr[i] for j in range(Q): temp = Arr[Queries[j][1]] # If the element was odd then # decrement it from the sum if(temp % 2 != 0): Sum -= temp # Update the array element for every query Arr[Queries[j][1]] += Queries[j][0] temp = Arr[Queries[j][1]] # If the updated value of temp is odd # then increment the sum if(temp % 2 != 0): Sum += temp # Append result of every query ans.append(Sum) # Return the answer array return ansArr = [1, 2, 3, 5]N = len(Arr)Q = 4Queries = [[1, 0], [-3, 1], [-4, 0], [2, 3]]# Function callans = Sumodd(N, Arr, Q, Queries)for i in range(len(ans)): print(ans[i], end=" ")# This code is contributed by lokeshmvs21. |
C#
// C# code to implement the approachusing System;using System.Collections;using System.Collections.Generic;public class GFG { // Function performing calculations static ArrayList Sumodd(int N, int[] Arr, int Q, int[, ] Queries) { // Declaring the answer array ArrayList ans = new ArrayList(); // Initializing the sum variable to 0. int sum = 0; for (int i = 0; i < N; i++) { // Loop to precomputing // the sum of odd elements if (Arr[i] % 2 != 0) { sum += Arr[i]; } } for (int j = 0; j < Q; j++) { int temp = Arr[Queries[j, 1]]; // If the element was odd then // decrement it from the sum if (temp % 2 != 0) { sum -= temp; } // Update the array element for every query Arr[Queries[j, 1]] += Queries[j, 0]; temp = Arr[Queries[j, 1]]; // If the updated value of temp is odd // then increment the sum if (temp % 2 != 0) { sum += temp; } // Push result of every query ans.Add(sum); } // Return the answer array return ans; } static public void Main() { // Code int[] Arr = { 1, 2, 3, 5 }; int N = Arr.Length; int Q = 4; int[, ] Queries = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call ArrayList ans = Sumodd(N, Arr, Q, Queries); for (int i = 0; i < ans.Count; i++) { Console.Write(ans[i] + " "); } }}// This code is contributed by lokesh. |
Javascript
// JS code to implement the approach// Function performing calculations.function Sumodd(N, Arr, Q, Queries){ // Declaring the answer array let ans = [] // Initializing the sum variable to 0. let sum = 0; for (let i = 0; i < N; i++) { // Loop to precomputing // the sum of odd elements if (Arr[i] % 2 != 0) { sum += Arr[i]; } } for (let j = 0; j < Q; j++) { let temp = Arr[Queries[j][1]]; // If the element was odd then // decrement it from the sum if (temp % 2 != 0) { sum -= temp; } // Update the array element for every query Arr[Queries[j][1]] += Queries[j][0]; temp = Arr[Queries[j][1]]; // If the updated value of temp is odd // then increment the sum if (temp % 2 != 0) { sum += temp; } // Push result of every query ans.push(sum); } // Return the answer array return ans;}// Driver codelet Arr = [ 1, 2, 3, 5 ];let N = Arr.length;let Q = 4;let Queries = [ [ 1, 0 ], [ -3, 1 ], [ -4, 0 ], [ 2, 3 ] ];// Function calllet ans = Sumodd(N, Arr, Q, Queries);console.log(ans);// This code is contributed by akashish__ |
Output
8 7 7 9
Time Complexity: O(max(Q, N)).
Auxiliary Space: O(Q) i.e answer array of Q size.
Another Approach:
- Start by including the necessary header files and defining the namespace as std.
- Define the function Sumodd() that takes four arguments – the size of the array N, the array itself Arr[], the number of queries Q, and the array of queries Queries[][2].
- Initialize an empty vector ans to store the results.
- Declare an integer array bit[] of size N+1 and initialize all its elements to zero.
- Initialize an integer variable sum to zero.
- Iterate over the elements of Arr[] using a for loop and check if each element is odd. If an element is odd, add it to the sum variable and update the corresponding index in bit[] by adding the element to it.
- For each query in Queries[][], extract the index and value from the query.
- Check if the element at the given index in Arr[] is odd. If it is odd, subtract it from both the sum variable and the corresponding index in bit[].
- Update the element at the given index in Arr[] by adding the given value.
- Check if the new value at the given index in Arr[] is odd. If it is odd, add it to both the sum variable and the corresponding index in bit[].
- Push the current value of sum to the ans vector.
- Return the ans vector.
- In the main() function, initialize the input arrays Arr[] and Queries[][].
- Call the Sumodd() function with the input arrays and store the result in a vector ans.
- Print the elements of the ans vector.
C++
#include <bits/stdc++.h>using namespace std;vector<int> Sumodd(int N, int Arr[], int Q, int Queries[][2]){ vector<int> ans; int bit[N + 1]; memset(bit, 0, sizeof(bit)); int sum = 0; for (int i = 0; i < N; i++) { if (Arr[i] % 2 != 0) { sum += Arr[i]; bit[i + 1] += Arr[i]; } } for (int i = 0; i < Q; i++) { int index = Queries[i][1]; int val = Queries[i][0]; if (Arr[index] % 2 != 0) { bit[index + 1] -= Arr[index]; sum -= Arr[index]; } Arr[index] += val; if (Arr[index] % 2 != 0) { bit[index + 1] += Arr[index]; sum += Arr[index]; } ans.push_back(sum); } return ans;}int main(){ int Arr[] = { 1, 2, 3, 5 }; int N = sizeof(Arr) / sizeof(Arr[0]); int Q = 4; int Queries[Q][2] = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call vector<int> ans = Sumodd(N, Arr, Q, Queries); for (int x : ans) cout << x << " "; return 0;} |
Java
import java.util.*;public class Main { public static void main(String[] args) { int[] arr = { 1, 2, 3, 5 }; int n = arr.length; int q = 4; int[][] queries = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; // Function call List<Integer> ans = sumOdd(n, arr, q, queries); for (int x : ans) System.out.print(x + " "); } public static List<Integer> sumOdd(int n, int[] arr, int q, int[][] queries) { List<Integer> ans = new ArrayList<>(); int[] bit = new int[n + 1]; int sum = 0; for (int i = 0; i < n; i++) { if (arr[i] % 2 != 0) { sum += arr[i]; bit[i + 1] += arr[i]; } } for (int i = 0; i < q; i++) { int index = queries[i][1]; int val = queries[i][0]; if (arr[index] % 2 != 0) { bit[index + 1] -= arr[index]; sum -= arr[index]; } arr[index] += val; if (arr[index] % 2 != 0) { bit[index + 1] += arr[index]; sum += arr[index]; } ans.add(sum); } return ans; }} |
Python3
def Sumodd(N, Arr, Q, Queries): ans = [] bit = [0] * (N + 1) sum_ = 0 for i in range(N): if Arr[i] % 2 != 0: sum_ += Arr[i] bit[i + 1] += Arr[i] for i in range(Q): index = Queries[i][1] val = Queries[i][0] if Arr[index] % 2 != 0: bit[index + 1] -= Arr[index] sum_ -= Arr[index] Arr[index] += val if Arr[index] % 2 != 0: bit[index + 1] += Arr[index] sum_ += Arr[index] ans.append(sum_) return ansArr = [1, 2, 3, 5]N = len(Arr)Q = 4Queries = [(1, 0), (-3, 1), (-4, 0), (2, 3)]# Function callans = Sumodd(N, Arr, Q, Queries)print(*ans) |
C#
using System;using System.Collections.Generic;class GFG{ static List<int> Sumodd(int N, int[] Arr, int Q, int[,] Queries) { // vector to store result List<int> ans = new List<int>(); int[] bit = new int[N + 1]; Array.Clear(bit, 0, bit.Length); int sum = 0; // Iterating over Arr[] for (int i = 0; i < N; i++) { // Checking if array element is odd if (Arr[i] % 2 != 0) { // Adding to sum sum += Arr[i]; // Updating the corresponding address in bit[] vector bit[i + 1] += Arr[i]; } } for (int i = 0; i < Q; i++) { // extracting index and value int index = Queries[i, 1]; int val = Queries[i, 0]; // element is odd if (Arr[index] % 2 != 0) { // subtract the element from corresponding index and sum variable bit[index + 1] -= Arr[index]; sum -= Arr[index]; } Arr[index] += val; if (Arr[index] % 2 != 0) { bit[index + 1] += Arr[index]; sum += Arr[index]; } // push the current value to ans vector ans.Add(sum); } // Returning ans vector return ans; } // Driver code static void Main() { int[] Arr = { 1, 2, 3, 5 }; int N = Arr.Length; int Q = 4; int[,] Queries = { { 1, 0 }, { -3, 1 }, { -4, 0 }, { 2, 3 } }; List<int> ans = Sumodd(N, Arr, Q, Queries); foreach (int x in ans) Console.Write(x + " "); }} |
Javascript
function Sumodd(N, Arr, Q, Queries) { const ans = []; const bit = new Array(N + 1).fill(0); let sum = 0; for (let i = 0; i < N; i++) { if (Arr[i] % 2 !== 0) { sum += Arr[i]; bit[i + 1] += Arr[i]; } } for (let i = 0; i < Q; i++) { const index = Queries[i][1]; const val = Queries[i][0]; if (Arr[index] % 2 !== 0) { bit[index + 1] -= Arr[index]; sum -= Arr[index]; } Arr[index] += val; if (Arr[index] % 2 !== 0) { bit[index + 1] += Arr[index]; sum += Arr[index]; } ans.push(sum); } return ans;}const Arr = [1, 2, 3, 5];const N = Arr.length;const Q = 4;const Queries = [ [1, 0], [-3, 1], [-4, 0], [2, 3]];// Function callconst ans = Sumodd(N, Arr, Q, Queries);for (let x of ans) { process.stdout.write(x + " ");} |
Output
8 7 7 9
Time Complexity:O(Q log N)
Auxiliary Space: O(N)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Share your thoughts in the comments
