# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
220368 | XmtosX | Vudu (COCI15_vudu) | C++17 | 945 ms | 65540 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;
const int N=1e6+6;
int n,a[N],p;
long long pfx[N];
set<long long> s;
int BIT[N];
unordered_map <long long,int> r;
int query(int x)
{
int sum = 0;
x++;
while (x>0)
{
sum += BIT[x];
x -= x & (-x);
}
return sum;
}
void update(int x)
{
x++;
while (x <= n)
{
BIT[x] ++;
x += x & (-x);
}
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
scanf("%d",&p);
for (int i=1;i<=n;i++)
{
pfx[i]=pfx[i-1]+a[i]-p;
s.insert(pfx[i]);
}
s.insert(0);
int cnt=0;
while (!s.empty())
{
r[*s.begin()]=cnt++;
s.erase(s.begin());
}
for (int i=0;i<=n;i++)
{
pfx[i]=r[pfx[i]];
}
long long ans=0;
for (int i=0;i<=n;i++)
{
ans+= query(pfx[i]);
update(pfx[i]);
}
cout <<ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |