Hard
You are given an integer array nums and two integers a and b.
For a non-empty subarrays, let:
x be the number of even elements.y be the number of odd elements.The ratio of even to odd elements in a subarray is defined as x / y, where ratios are compared by their exact rational values.
A subarray is considered valid if:
y > 0, andx / y <= a / b.Return the number of valid subarrays in nums.
Example 1:
Input: nums = [1,2,1,2], a = 3, b = 2
Output: 7
Explanation:
The following are the valid subarrays:
| Subarray | Values | Even Count | Odd Count | Ratio |
|---|---|---|---|---|
nums[0..0] |
[1] |
0 | 1 | 0 / 1 |
nums[0..1] |
[1, 2] |
1 | 1 | 1 / 1 |
nums[0..2] |
[1, 2, 1] |
1 | 2 | 1 / 2 |
nums[0..3] |
[1, 2, 1, 2] |
2 | 2 | 2 / 2 |
nums[1..2] |
[2, 1] |
1 | 1 | 1 / 1 |
nums[2..2] |
[1] |
0 | 1 | 0 / 1 |
nums[2..3] |
[1, 2] |
1 | 1 | 1 / 1 |
Thus, the number of valid subarrays is 7.
Example 2:
Input: nums = [2,2,1], a = 2, b = 1
Output: 3
Explanation:
The following are the valid subarrays:
| Subarray | Values | Even Count | Odd Count | Ratio |
|---|---|---|---|---|
nums[0..2] |
[2, 2, 1] |
2 | 1 | 2 / 1 |
nums[1..2] |
[2, 1] |
1 | 1 | 1 / 1 |
nums[2..2] |
[1] |
0 | 1 | 0 / 1 |
Thus, the number of valid subarrays is 3.
Example 3:
Input: nums = [2,2,2], a = 1, b = 1
Output: 0
Explanation:
Every subarray contains 0 odd numbers, so no subarray is valid.
Constraints:
1 <= nums.length <= 1051 <= nums[i] <= 1091 <= a, b <= 109@SuppressWarnings("java:S2234")
public class Solution {
public long countRatioSubarrays(int[] nums, int a, int b) {
int n = nums.length;
long[] arr = new long[n + 1];
long[] temp = new long[n + 1];
long sum = 0;
for (int i = 0; i < n; i++) {
sum += nums[i] % 2 == 1 ? a : -b;
arr[i + 1] = temp[i + 1] = sum;
}
return mergeSort(0, n, arr, temp);
}
private long mergeSort(int l, int r, long[] arr, long[] temp) {
if (l == r) {
return 0;
}
int m = (l + r) / 2;
long result = mergeSort(l, m, temp, arr) + mergeSort(m + 1, r, temp, arr);
int idx = l;
int i = l;
int j = m + 1;
while (i <= m && j <= r) {
if (temp[i] <= temp[j]) {
arr[idx++] = temp[i++];
} else {
result += i - l;
arr[idx++] = temp[j++];
}
}
while (i <= m) {
arr[idx++] = temp[i++];
}
while (j <= r) {
result += i - l;
arr[idx++] = temp[j++];
}
return result;
}
}