# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463727 | Hamed5001 | Vudu (COCI15_vudu) | C++14 | 494 ms | 19864 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxN = 1e6+10;
int BIT[mxN], N, P;
vector<ll> A, APR;
void add(int idx, int delta) {
for (; idx <= N; idx += idx & -idx)
BIT[idx] += delta;
}
int query(int idx) {
int ret = 0;
for (; idx > 0; idx -= idx & -idx)
ret += BIT[idx];
return ret;
}
void solve() {
scanf("%d", &N);
A.resize(N);
for (auto& a : A) scanf("%lld", &a);
scanf("%d", &P);
ll sum = 0;
for (auto& a : A) {
a -= P;
sum += a;
APR.push_back(sum);
}
sort(APR.begin(), APR.end());
for (int i = 0; i < N; i++) {
add(N - i, 1);
}
sum = 0;
ll ans = 0;
for (auto a : A) {
ans += query(APR.end() - lower_bound(APR.begin(), APR.end(), sum));
sum += a;
add(APR.end() - lower_bound(APR.begin(), APR.end(), sum), -1);
}
printf("%lld", ans);
}
int main() {
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |