Task: | Subarray Sums II |
Sender: | odanobunaga8199 |
Submission time: | 2024-11-25 18:29:49 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.12 s | details |
#6 | ACCEPTED | 0.11 s | details |
#7 | ACCEPTED | 0.03 s | details |
#8 | ACCEPTED | 0.04 s | details |
#9 | ACCEPTED | 0.06 s | details |
#10 | ACCEPTED | 0.06 s | details |
#11 | ACCEPTED | 0.06 s | details |
#12 | ACCEPTED | 0.10 s | details |
#13 | ACCEPTED | 0.12 s | details |
#14 | ACCEPTED | 0.12 s | details |
#15 | ACCEPTED | 0.11 s | details |
#16 | ACCEPTED | 0.00 s | details |
#17 | ACCEPTED | 0.00 s | details |
#18 | ACCEPTED | 0.06 s | details |
#19 | ACCEPTED | 0.11 s | details |
#20 | ACCEPTED | 0.05 s | details |
#21 | ACCEPTED | 0.10 s | details |
#22 | ACCEPTED | 0.11 s | details |
#23 | ACCEPTED | 0.11 s | details |
#24 | ACCEPTED | 0.00 s | details |
#25 | ACCEPTED | 0.06 s | details |
#26 | ACCEPTED | 0.07 s | details |
#27 | ACCEPTED | 0.06 s | details |
#28 | ACCEPTED | 0.10 s | details |
Code
#include <bits/stdc++.h> using namespace std; // Custom hash function to prevent unordered_map from worst-case performance struct custom_hash { // Splitmix64 hash function for better distribution size_t operator()(const long long& key) const { size_t res = key; res += 0x9e3779b97f4a7c15; res = (res ^ (res >> 30)) * 0xbf58476d1ce4e5b9; res = (res ^ (res >> 27)) * 0x94d049bb133111eb; res = res ^ (res >> 31); return res; } }; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); long long n, x; cin >> n >> x; // Read the size of the array and the target sum vector<long long> a(n); for(auto &num : a) cin >> num; // Read the array elements // Initialize an unordered_map with the custom hash // The map will store prefix_sum -> frequency unordered_map<long long, long long, custom_hash> prefix_counts; prefix_counts[0] = 1; // Base case: prefix_sum of 0 occurs once long long current_sum = 0; // Initialize current prefix sum long long answer = 0; // Initialize the answer // Iterate through the array for(int i = 0; i < n; ++i){ current_sum += a[i]; // Update the current prefix sum // Check if (current_sum - x) exists in the map // If it does, it means there's a subarray ending at index i with sum x if(prefix_counts.find(current_sum - x) != prefix_counts.end()){ answer += prefix_counts[current_sum - x]; } // Update the map with the current prefix sum prefix_counts[current_sum]++; } cout << answer; // Output the total number of qualifying subarrays }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
100 50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
51 |
user output |
---|
51 |
Test 2
Verdict: ACCEPTED
input |
---|
100 1000000000 1000000000 1000000000 10000000... |
correct output |
---|
100 |
user output |
---|
100 |
Test 3
Verdict: ACCEPTED
input |
---|
100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
5050 |
user output |
---|
5050 |
Test 4
Verdict: ACCEPTED
input |
---|
100 4 2 1 -3 2 -7 7 -2 6 9 -4 10 -6 ... |
correct output |
---|
53 |
user output |
---|
53 |
Test 5
Verdict: ACCEPTED
input |
---|
200000 100000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
100001 |
user output |
---|
100001 |
Test 6
Verdict: ACCEPTED
input |
---|
200000 1000000000 1000000000 1000000000 10000000... |
correct output |
---|
200000 |
user output |
---|
200000 |
Test 7
Verdict: ACCEPTED
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
20000100000 |
user output |
---|
20000100000 |
Test 8
Verdict: ACCEPTED
input |
---|
200000 39 44 -62 -3 23 11 -68 42 69 -22 ... |
correct output |
---|
903601 |
user output |
---|
903601 |
Test 9
Verdict: ACCEPTED
input |
---|
131072 199999 199999 199999 199999 199999 19... |
correct output |
---|
131072 |
user output |
---|
131072 |
Test 10
Verdict: ACCEPTED
input |
---|
131072 107897 107897 107897 107897 107897 10... |
correct output |
---|
131072 |
user output |
---|
131072 |
Test 11
Verdict: ACCEPTED
input |
---|
131072 126271 126271 126271 126271 126271 12... |
correct output |
---|
131072 |
user output |
---|
131072 |
Test 12
Verdict: ACCEPTED
input |
---|
200000 107897 107897 107897 107897 107897 10... |
correct output |
---|
199999 |
user output |
---|
199999 |
Test 13
Verdict: ACCEPTED
input |
---|
200000 100000 1056323 1056323 1056323 105632... |
correct output |
---|
0 |
user output |
---|
0 |
Test 14
Verdict: ACCEPTED
input |
---|
200000 100000 2144977 2144977 2144977 214497... |
correct output |
---|
0 |
user output |
---|
0 |
Test 15
Verdict: ACCEPTED
input |
---|
200000 100000 65536 65536 65536 65536 65536 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 16
Verdict: ACCEPTED
input |
---|
5 0 0 0 0 0 0 |
correct output |
---|
15 |
user output |
---|
15 |
Test 17
Verdict: ACCEPTED
input |
---|
20 536870912 268435456 268435456 268435456 ... |
correct output |
---|
19 |
user output |
---|
19 |
Test 18
Verdict: ACCEPTED
input |
---|
131072 136607 136607 136607 136607 136607 13... |
correct output |
---|
131072 |
user output |
---|
131072 |
Test 19
Verdict: ACCEPTED
input |
---|
200000 562841 562841 562841 562841 562841 56... |
correct output |
---|
200000 |
user output |
---|
200000 |
Test 20
Verdict: ACCEPTED
input |
---|
107897 107897 107897 107897 107897 107897 10... |
correct output |
---|
107897 |
user output |
---|
107897 |
Test 21
Verdict: ACCEPTED
input |
---|
200000 202409 101204 101205 101204 101205 10... |
correct output |
---|
199998 |
user output |
---|
199998 |
Test 22
Verdict: ACCEPTED
input |
---|
200000 202409 138630 138631 138630 138631 13... |
correct output |
---|
0 |
user output |
---|
0 |
Test 23
Verdict: ACCEPTED
input |
---|
200000 10273 410857 410857 410857 410857 41... |
correct output |
---|
0 |
user output |
---|
0 |
Test 24
Verdict: ACCEPTED
input |
---|
5 2 1 -1 1 -1 2 |
correct output |
---|
3 |
user output |
---|
3 |
Test 25
Verdict: ACCEPTED
input |
---|
200000 1 1048577 -1048570 29 145 725 36... |
correct output |
---|
104671 |
user output |
---|
104671 |
Test 26
Verdict: ACCEPTED
input |
---|
200000 1 1048577 -1048571 25 125 625 31... |
correct output |
---|
104859 |
user output |
---|
104859 |
Test 27
Verdict: ACCEPTED
input |
---|
200000 0 5334500 -3502392 3421268 -2064... |
correct output |
---|
6341575890 |
user output |
---|
6341575890 |
Test 28
Verdict: ACCEPTED
input |
---|
200000 0 172933 172933 172933 172933 17... |
correct output |
---|
0 |
user output |
---|
0 |