# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1030717 | fv3 | Arranging Shoes (IOI19_shoes) | C++14 | 1070 ms | 5076 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;
typedef long long ll;
ll dist(vector<int> d, vector<int> v)
{
vector<ll> m(v.size());
ll res = 0;
for (auto e : d)
{
for (int i = 0; i < v.size(); i++)
{
if (v[i] == -e)
{
v.erase(v.begin() + i);
break;
}
res++;
}
for (int i = 0; i < v.size(); i++)
{
if (v[i] == e)
{
v.erase(v.begin() + i);
break;
}
res++;
}
}
return res;
}
ll count_swaps(vector<int> s)
{
const ll N = s.size() / 2;
vector<int> perm;
for (auto e : s)
if (e > 0)
perm.push_back(e);
sort(perm.begin(), perm.end());
ll res = 1ll << 60;
do
{
res = min(res, dist(perm, s));
} while (next_permutation(perm.begin(), perm.end()));
return res;
}
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... |