Skip to content

Commit 20ab4e2

Browse files
authored
Create sum-of-special-evenly-spaced-elements-in-array.cpp
1 parent 1ae1921 commit 20ab4e2

File tree

1 file changed

+32
-0
lines changed

1 file changed

+32
-0
lines changed
Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
// Time: O(n * sqrt(n))
2+
// Space: O(n * sqrt(n))
3+
4+
class Solution {
5+
public:
6+
vector<int> solve(vector<int>& nums, vector<vector<int>>& queries) {
7+
static const int MOD = 1e9 + 7;
8+
9+
vector<vector<vector<int>>> prefix(floor(sqrt(size(queries))) + 1, vector<vector<int>>(floor(sqrt(size(queries))) + 1));
10+
vector<int> result;
11+
for (const auto& query : queries) {
12+
int x = query[0], y = query[1];
13+
if (uint64_t(y) * y > size(queries)) {
14+
int total = 0;
15+
for (int i = x; i < size(nums); i += y) {
16+
total = (total + nums[i]) % MOD;
17+
}
18+
result.emplace_back(total);
19+
} else {
20+
int begin = x % y;
21+
if (empty(prefix[begin][y])) {
22+
prefix[begin][y].emplace_back(0);
23+
for (int i = begin; i < size(nums); i += y) {
24+
prefix[begin][y].emplace_back((prefix[begin][y].back() + nums[i]) % MOD);
25+
}
26+
}
27+
result.emplace_back((prefix[begin][y].back() - prefix[begin][y][x / y] + MOD) % MOD);
28+
}
29+
}
30+
return result;
31+
}
32+
};

0 commit comments

Comments
 (0)