Commit eef6fad

authored

Update 3624.Number-of-Integers-With-Popcount-Depth-Equal-to-K-II.cpp

1 parent d447a82 commit eef6fadCopy full SHA for eef6fad

File tree

-4

lines changed

Segment_Tree/3624.Number-of-Integers-With-Popcount-Depth-Equal-to-K-II
- 3624.Number-of-Integers-With-Popcount-Depth-Equal-to-K-II.cpp

-4

lines changed

Lines changed: 7 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,10 +55,10 @@ class Solution {`
`55`	`55`
`56`	`56`	`vector<int> popcountDepth(vector<long long>& nums, vector<vector<long long>>& queries) {`
`57`	`57`	`int N = nums.size()+1;`
`58`		`- vector<BIT> bit_arr (6);`
`59`		`- for (int i=0; i<=5; i++)`
	`58`	`+ vector<BIT> bit_arr (5);`
	`59`	`+ for (int i=0; i<=4; i++)`
`60`	`60`	`bit_arr[i].init(N);`
`61`		`-`
	`61`	`+`
`62`	`62`	`for (int i=0; i<nums.size(); i++) {`
`63`	`63`	`int depth = getDepth(nums[i]);`
`64`	`64`	`bit_arr[depth].updateDelta(i+1, 1);`
`@@ -75,7 +75,10 @@ class Solution {`
`75`	`75`	`nums[idx] = val;`
`76`	`76`	`} else {`
`77`	`77`	`int l = q[1], r = q[2], k = q[3];`
`78`		`- rets.push_back(bit_arr[k].sumRange(l+1,r+1));`
	`78`	`+ if (k>=5)`
	`79`	`+ rets.push_back(0);`
	`80`	`+ else`
	`81`	`+ rets.push_back(bit_arr[k].sumRange(l+1,r+1));`
`79`	`82`	`}`
`80`	`83`	`}`
`81`	`84`

Comments

(0)