# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
446266 |
2021-07-21T11:44:38 Z |
zxcvbnm |
Vudu (COCI15_vudu) |
C++14 |
|
387 ms |
56948 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
struct Ft {
vector<ll> bit;
int n;
void build(vector<ll> a) {
n = a.size()+2;
bit.assign(2*n, 0);
}
void update(int idx, int x) {
while(idx <= n) {
bit[idx] += x;
idx += idx & -idx;
}
}
ll sum(int idx) {
ll sum = 0;
while(idx > 0) {
sum += bit[idx];
idx -= idx & -idx;
}
return sum;
}
};
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("test.in", "r", stdin);
int n;
cin >> n;
vector<int> a(n);
for(int& i : a) {
cin >> i;
}
int p;
cin >> p;
vector<ll> sum = {0};
for(int i : a) {
sum.push_back(sum.back()+(i-p));
}
vector<ll> sums = sum;
sort(sums.begin(), sums.end());
Ft ft;
ft.build(sums);
ll ans = 0;
for(ll i : sum) {
int idx = lower_bound(sums.begin(), sums.end(), i) - sums.begin();
ans += ft.sum(idx+1);
ft.update(idx+1, +1);
}
cout << ans << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
716 KB |
Output is correct |
2 |
Correct |
2 ms |
588 KB |
Output is correct |
3 |
Correct |
2 ms |
588 KB |
Output is correct |
4 |
Correct |
387 ms |
55084 KB |
Output is correct |
5 |
Correct |
206 ms |
26020 KB |
Output is correct |
6 |
Correct |
329 ms |
48776 KB |
Output is correct |
7 |
Correct |
338 ms |
50852 KB |
Output is correct |
8 |
Correct |
289 ms |
44084 KB |
Output is correct |
9 |
Correct |
379 ms |
56948 KB |
Output is correct |
10 |
Correct |
329 ms |
49436 KB |
Output is correct |