Company: Visa fte
Difficulty: medium
\n Queue: Array Queries \n \n \n You are given two arrays of integers a and b , and an array queries containing the queries you are required to process. Every queries[i] can have one of the following two forms: \n \n [0, x] : In this case, you need to add 2 to the current value of b[x] . \n [1, x] : In this case, you need to find the total number of pairs of indices i and j such that a[i] + b[j] = x . \n \n Perform the given queries in order and return an array containing the results of the queries of the type [1, x] . \n \n\n \n Input Format \n The input consists of: \n \n An array of integers a . \n An array of integers b . \n An array of queries, where each query is an array of integers. \n \n \n\n \n Output Format \n Return an array of integers representing the results of the queries of type [1, x] . \n \n\n \n Constraints \n \n 1 ≤ a.length ≤ 10 5 \n 1 ≤ b.length ≤ 10 5 \n 0 ≤ a[i], b[i] ≤ 10 9 \n 0 ≤ queries.length ≤ 10 5 \n \n \n\n \n Examples \n \n Example 1: \n Input:\na = [1,