Submission details
Task:Array
Sender:Pietari Kaskela
Submission time:2015-09-30 18:26:51 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.06 sdetails
#2ACCEPTED0.06 sdetails
#3ACCEPTED0.06 sdetails
#4ACCEPTED0.06 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.06 sdetails
#7ACCEPTED0.07 sdetails
#8ACCEPTED0.08 sdetails
#9ACCEPTED0.07 sdetails
#10ACCEPTED0.07 sdetails
#11ACCEPTED0.09 sdetails
#12ACCEPTED0.08 sdetails
#13ACCEPTED0.10 sdetails
#14ACCEPTED0.09 sdetails
#15ACCEPTED0.09 sdetails
#16ACCEPTED0.10 sdetails
#17ACCEPTED0.10 sdetails
#18ACCEPTED0.11 sdetails
#19ACCEPTED0.08 sdetails
#20ACCEPTED0.09 sdetails
#210.06 sdetails

Code

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;


int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	int n, x; cin >> n >> x;
	i64 a[101010];
	for(int i = 0; i < n; i++)
		cin >> a[i];
	i64 s[101010] = {0};
	s[0] = a[0];

	unordered_map<i64, int> sums;
	
	vector<i64> remo;
	for(int i = 1; i < n; i++){
		s[i] = s[i-1]+a[i];
	}
	for(int i = 0; i < n; i++){
		sums[s[i]]++;
		remo.push_back(s[i]);
	}
	i64 rem = 0;
	int re = 0;
	for(int i = 0; i < n; i++){
		//cout << i << ": " << endl;
		//for(auto f: sums)
		//	cout << f.first-rem << " ";
		//cout << endl;
		re+=sums[x+rem];
		rem+=a[i];
		sums[remo[i]]--;
	}
	cout << re << endl;
	return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
89384 -6
-1 9 -2 0 0 -1 5 0 -8 9 10 -6 ...

correct output
2029635

user output
2029635

Test 2

Verdict: ACCEPTED

input
32688 -4
6 0 9 -10 -2 -2 -1 5 -5 -6 9 8...

correct output
321307

user output
321307

Test 3

Verdict: ACCEPTED

input
11023 2
5 0 -1 9 -10 3 10 -10 1 -3 -8 ...

correct output
146015

user output
146015

Test 4

Verdict: ACCEPTED

input
36884 -7
6 8 2 -4 1 7 1 -7 5 3 1 -6 1 -...

correct output
471565

user output
471565

Test 5

Verdict: ACCEPTED

input
2875 -6
-4 1 -6 -10 -2 -5 9 0 -2 9 -3 ...

correct output
9343

user output
9343

Test 6

Verdict: ACCEPTED

input
52346 -111
973 629 570 312 541 -117 332 7...

correct output
8791

user output
8791

Test 7

Verdict: ACCEPTED

input
55283 298
593 -881 937 901 -91 -622 632 ...

correct output
7351

user output
7351

Test 8

Verdict: ACCEPTED

input
93592 -589
951 -193 -855 -692 926 -602 -6...

correct output
26431

user output
26431

Test 9

Verdict: ACCEPTED

input
98149 942
-816 178 196 -503 654 -474 -64...

correct output
37659

user output
37659

Test 10

Verdict: ACCEPTED

input
79573 -346
-161 619 720 182 726 452 -63 -...

correct output
19690

user output
19690

Test 11

Verdict: ACCEPTED

input
100000 -9229
-6207 -4894 -1224 8410 -2954 4...

correct output
1969

user output
1969

Test 12

Verdict: ACCEPTED

input
100000 4655
134 4684 8364 -7381 -1874 3429...

correct output
2353

user output
2353

Test 13

Verdict: ACCEPTED

input
100000 -5901
-4907 7494 7673 -3917 -3223 -7...

correct output
2345

user output
2345

Test 14

Verdict: ACCEPTED

input
100000 -2507
-845 -6674 -3174 9309 -1411 53...

correct output
2242

user output
2242

Test 15

Verdict: ACCEPTED

input
100000 -4850
-9232 -2843 5422 -5336 -2835 -...

correct output
3753

user output
3753

Test 16

Verdict: ACCEPTED

input
100000 -745023
-561148 78606 440682 608892 -3...

correct output
27

user output
27

Test 17

Verdict: ACCEPTED

input
100000 987216
602043 416718 216813 720665 -6...

correct output
41

user output
41

Test 18

Verdict: ACCEPTED

input
100000 -140762
-813926 -641015 5926 -87604 -8...

correct output
43

user output
43

Test 19

Verdict: ACCEPTED

input
100000 -828680
-53023 -23367 -91278 162438 82...

correct output
27

user output
27

Test 20

Verdict: ACCEPTED

input
100000 -731243595
-728764339 -159138563 36776806...

correct output
0

user output
0

Test 21

Verdict:

input
100000 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

correct output
5000050000

user output
705082704