# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650160 | activedeltorre | Arranging Shoes (IOI19_shoes) | C++14 | 23 ms | 3516 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 <vector>
using namespace std;
long long count_swaps(vector<int>vec)
{
int n=vec.size();
int fre[2005];
int fre2[2005],k;
long long suma=0,i,j,minim,curr,u,h;
int sz=n;
for(k=1; k<=n/2; k++)
{
for(i=1; i<=n/2; i++)
{
fre[i]=-1;
fre2[i]=-1;
}
for(i=0; i<sz; i++)
{
if(vec[i]>0)
{
if(fre[vec[i]]==-1)
{
fre[vec[i]]=i;
}
}
else
{
if(fre2[-vec[i]]==-1)
{
fre2[-vec[i]]=i;
}
}
}
minim=2*n;
for(i=1;i<=n/2;i++)
{
if(fre[i]!=-1)
{
if(fre[i]>fre2[i])
{
curr=fre[i]+fre2[i]-1;
}
else
{
curr=fre[i]+fre2[i];
}
}
if(curr<minim)
{
u=fre[i];
h=fre2[i];
minim=curr;
}
}
suma=suma+minim;
sz=sz-2;
vec.erase(vec.begin()+max(u,h));
vec.erase(vec.begin()+min(u,h));
}
return suma;
}
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... |