# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597899 | Hanksburger | Arranging Shoes (IOI19_shoes) | C++17 | 62 ms | 15308 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
int a[200005], pos2[200005], n, cnt;
vector<int> pos[200005];
void upd(int x)
{
for (int i=x; i<n*2; i+=i&(-i))
a[i]++;
}
int qry(int x)
{
int sum=0;
for (int i=x; i; i-=i&(-i))
sum+=a[i];
return sum;
}
long long count_swaps(vector<int> v)
{
n=cnt=v.size()/2;
for (int i=0; i<n*2; i++)
pos[v[i]+n].push_back(i);
long long ans=0;
for (int i=1; i<=n; i++)
{
for (int j=0; j<pos[n+i].size(); j++)
{
if (j)
{
v[pos[n+i][j]]=++cnt;
v[pos[n-i][j]]=-cnt;
}
if (pos[n+i][j]<pos[n-i][j])
{
swap(v[pos[n+i][j]], v[pos[n-i][j]]);
ans++;
}
}
}
for (int i=0; i<n*2; i++)
if (v[i]>0)
pos2[v[i]]=i;
for (int i=0; i<n*2; i++)
{
if (v[i]<0)
{
int p=pos2[-v[i]];
ans+=p-i-1-qry(p)+qry(i);
upd(p);
}
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |