# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335632 | Joshc | Vudu (COCI15_vudu) | C++11 | 324 ms | 31796 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 <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define f first
#define s second
ll l[1000001];
int bit[1000001], m[1000001];
int main() {
ll n, p, count=1, ans=0;
scanf("%lld", &n);
for (int i=1; i<=n; i++) scanf("%lld", &l[i]);
scanf("%lld", &p);
l[0] = 0;
for (int i=1; i<=n; i++) l[i] = l[i-1]+l[i]-p;
vector<pair<ll, int> > arr;
for (int i=0; i<=n; i++) arr.emplace_back(l[i], i);
sort(arr.begin(), arr.end());
m[arr[0].s] = 1;
for (int i=1; i<=n; i++) {
if (arr[i].f != arr[i-1].f) count++;
m[arr[i].s] = count;
}
for (int i=n; i>=0; i--) {
for (int j=m[i]; j<=n; j+=j&-j) bit[j]++;
for (int j=m[i]-1; j>0; j-=j&-j) ans += bit[j];
}
printf("%lld\n", n*(n+1)/2-ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |