# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
836172 | Denkata | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 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>
#include "shoes.h"
#include "grader.cpp"
using namespace std;
const int maxn = 1e5+3;
long long i,j,ans,p;
deque <int> pos[maxn*2];
long long count_swaps(vector<int> s)
{
ans = 0;
j = 1;
for(auto i:s)
{
if(pos[-i+maxn].empty())
pos[i+maxn].push_back(j);
else
{
p = pos[-i+maxn].front();
pos[-i+maxn].pop_front();
ans+=j-p-1;
if(i<0)
ans++;
}
j++;
}
return ans;
}