# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
893275 | kokoue | Money (IZhO17_money) | C++14 | 1 ms | 2392 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;
int tree[1000000];
int n;
int a[1000000];
void update(int idx, int val)
{
for(int i=idx;i<=n;i+=i&(-i))
{
tree[i]+=val;
}
// printf("update %d = %d\n",idx,val);
return;
}
long long query(int idx)
{
long long res=0;
for(int i=idx;i>0;i-=i&(-i))
{
res+=tree[i];
}
// printf("query %d = %d\n",idx,res);
return res;
}
long long query(int l,int r)
{
// printf("query %d and %d\n",l,r);
if(l==r) return 0;
return query(r)-query(l);
}
int main()
{
scanf("%d",&n);
long long br=0;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=2;i<=n;i++)
{
update(i,1);
}
for(int i=n-1;i>0;i--)
{
br+=query(a[i],n);
update(a[i],-1);
}
printf("%lld\n",br);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |