# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
968073 |
2024-04-23T07:33:00 Z |
vjudge1 |
Vudu (COCI15_vudu) |
C++17 |
|
266 ms |
30948 KB |
#include<bits/stdc++.h>
using namespace std;
int n, fw[1000001];
long long ans;
void update(int idx, int val){
for(; idx <= n; idx+=(idx&-idx)) fw[idx]+=val;
}
long long query(int idx){
long long sum = 0;
for(; idx; idx-=(idx&-idx)) sum+=fw[idx];
return sum;
}
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n;
long long qs[n+1], k;
vector<long long> v;
memset(qs, 0, sizeof(qs));
for(int i = 1; i<=n; ++i) cin >> qs[i];
cin >> k;
for(int i = 1; i<=n; ++i) qs[i]+=qs[i - 1];
for(int i = 1; i<=n; ++i) v.push_back(qs[i] - i*k);
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()));
for(int i = 0; i<=n; ++i){
int id = lower_bound(v.begin(), v.end(), qs[i] - i*k) - v.begin();
ans+=query(id+1);
update(id+1, 1);
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
604 KB |
Output is correct |
2 |
Correct |
2 ms |
484 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
266 ms |
19476 KB |
Output is correct |
5 |
Correct |
135 ms |
13536 KB |
Output is correct |
6 |
Runtime error |
132 ms |
30948 KB |
Execution killed with signal 11 |
7 |
Correct |
220 ms |
18256 KB |
Output is correct |
8 |
Correct |
202 ms |
17076 KB |
Output is correct |
9 |
Correct |
249 ms |
19896 KB |
Output is correct |
10 |
Correct |
218 ms |
17484 KB |
Output is correct |