# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341752 | ogibogi2004 | Arranging Shoes (IOI19_shoes) | C++14 | 113 ms | 44524 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;
#define ll long long
const ll MAXN=1e5+6;
ll fen[MAXN];
void update(ll idx,ll val)
{
idx++;
for(;idx<MAXN;idx+=idx&(-idx))
{
fen[idx]+=val;
}
}
ll query(ll idx)
{
idx++;
ll ret=0;
for(;idx>0;idx-=idx&(-idx))
{
ret+=fen[idx];
}
return ret;
}
set<int>shoes[MAXN][2];
bool vis[MAXN];
long long count_swaps(vector<int> s) {
for(int i=0;i<s.size();i++)
{
if(s[i]>0)shoes[s[i]][0].insert(i);
else shoes[-s[i]][1].insert(i);
}
for(int i=0;i<s.size();i++)
{
update(i,+1);
}
ll ans=0;
for(int i=0;i<s.size();i++)
{
if(vis[i])continue;
if(s[i]<0)
{
ll k=(*shoes[-s[i]][0].begin());
ans+=query(k)-query(i)-1;
update(i,+1);
vis[k]=1;
update(k+1,-1);
shoes[-s[i]][0].erase(k);
shoes[-s[i]][1].erase(i);
}
else
{
ll k=(*shoes[s[i]][1].begin());
ans+=query(k)-query(i);
update(i,+1);
update(k+1,-1);
vis[k]=1;
shoes[s[i]][1].erase(k);
shoes[s[i]][0].erase(i);
}
}
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... |