/*
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ord tree<llo,null_type,less_equal<llo>,rb_tree_tag,tree_order_statistics_node_update>
int n;
int it[1000001];
int p;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(llo i=0;i<n;i++){
cin>>it[i];
}
cin>>p;
for(llo i=0;i<n;i++){
it[i]-=p;
}
ord ss;
llo ans=0;
llo su=0;
ss.insert(0);
for(llo i=0;i<n;i++){
su+=it[i];
ans+=ss.order_of_key(su+1);
ss.insert(su);
//cout<<ans<<endl;
}
cout<<ans<<endl;
return 0;
}
/*
g++ -o aa -O2 box.cpp grader.cpp -std=c++14
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
896 KB |
Output is correct |
2 |
Correct |
3 ms |
768 KB |
Output is correct |
3 |
Correct |
3 ms |
768 KB |
Output is correct |
4 |
Correct |
743 ms |
65536 KB |
Output is correct |
5 |
Correct |
351 ms |
36728 KB |
Output is correct |
6 |
Correct |
607 ms |
60592 KB |
Output is correct |
7 |
Correct |
573 ms |
65536 KB |
Output is correct |
8 |
Correct |
520 ms |
51740 KB |
Output is correct |
9 |
Runtime error |
610 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
10 |
Correct |
622 ms |
62328 KB |
Output is correct |