# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794535 | Pablo_No | Arranging Shoes (IOI19_shoes) | C++17 | 6 ms | 9700 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 <iostream>
#include <set>
using namespace std;
const int N = 1e5+5;
set<int> p[2*N];
int mvs[2*N];
long long count_swaps(std::vector<int> s) {
long long ans = 0;
for(int i = 0; i < s.size(); i++)
{
int ai = s[i];
if(!p[-ai+N].empty())
{
int fp = *p[-ai+N].begin();
ans += (i-fp)-(ai > 0)+mvs[fp];
for(int x = fp+1; x < i; x++)
mvs[i]++;
p[-ai+N].erase(fp);
}
else
{
p[ai+N].insert(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... |