# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
620485 |
2022-08-03T06:25:34 Z |
sword060 |
Vudu (COCI15_vudu) |
C++17 |
|
514 ms |
65536 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
long long seg[4*N],xd,ans,a[N],x,k;
vector<long long>comp;
map<long long,int>mp;
long long query(int i,int l,int r,int s,int e){
if(l>e||r<s)return 0;
if(l>=s&&r<=e){
return seg[i];
}
int mid=(l+r)/2;
return (query((i<<1),l,mid,s,e)+query((i<<1|1),mid+1,r,s,e));
}
void update(int i,int l,int r,int s){
if(l>s||r<s)return;
if(l==s&&r==s){
seg[i]++;
return;
}
int mid = (l+r)/2;
update((i<<1),l,mid,s);
update((i<<1|1),mid+1,r,s);
seg[i]=(seg[i<<1]+seg[i<<1|1]);
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>x;
for(int i=0;i<x;i++)cin>>a[i];
cin>>k;
comp.push_back(0);
for(int i=0;i<x;i++){
a[i]-=k;
xd+=a[i];
comp.push_back(xd);
}
sort(comp.begin(),comp.end());
int z=0;
for(int i=0;i<(int)comp.size();i++)if(mp.find(comp[i])==mp.end())mp[comp[i]]=z++;
xd=0;
update(1,0,N,mp[0]);
/*for(int i=0;i<x;i++){
xd+=a[i];
ans+=query(1,0,N,0,mp[xd]);
update(1,0,N,mp[xd]);
}*/
cout<<ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
852 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
732 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
724 KB |
Output isn't correct |
4 |
Runtime error |
470 ms |
65536 KB |
Execution killed with signal 9 |
5 |
Incorrect |
323 ms |
43096 KB |
Output isn't correct |
6 |
Runtime error |
483 ms |
65536 KB |
Execution killed with signal 9 |
7 |
Runtime error |
514 ms |
65536 KB |
Execution killed with signal 9 |
8 |
Incorrect |
511 ms |
61284 KB |
Output isn't correct |
9 |
Runtime error |
513 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Runtime error |
510 ms |
65536 KB |
Execution killed with signal 9 |