#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<long long, null_type,less_equal<long long>, rb_tree_tag,tree_order_statistics_node_update>
ordered_set s;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int x,k;cin>>x;
int a[x+3];
long long ans=0;
for(int i=0;i<x;i++)cin>>a[i];
cin>>k;
for(int i=0;i<x;i++)a[i]-=k;
s.insert(0);
long long xd=0;
for(int i=0;i<x;i++){
xd+=a[i];
ans+=s.order_of_key(xd+1);
s.insert(xd);
}
cout<<ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
852 KB |
Output is correct |
2 |
Correct |
2 ms |
596 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
4 |
Correct |
611 ms |
64560 KB |
Output is correct |
5 |
Correct |
314 ms |
36672 KB |
Output is correct |
6 |
Correct |
504 ms |
57164 KB |
Output is correct |
7 |
Correct |
476 ms |
59528 KB |
Output is correct |
8 |
Correct |
461 ms |
51604 KB |
Output is correct |
9 |
Runtime error |
551 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Correct |
471 ms |
57956 KB |
Output is correct |