# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758885 | Trumling | Arranging Shoes (IOI19_shoes) | C++14 | 1088 ms | 3412 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;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
long long count_swaps(vector<int> s)
{
ll nn=s.size();
ll answ=0;
for(int r=0;r<nn;r+=2)
{
ll found[nn+1]={ };
for(int i=r;i<nn;i++)
if(s[i]>0 && !found[s[i]])
found[s[i]]=i;
pair<ll,ll>ans;
ans={INF,0};
for(int i=r;i<nn;i++)
if(s[i]<0)
{
if(found[-s[i]]<i && ans.F>abs(r-i)+abs(found[-s[i]]-r))
ans={abs(r-i)+abs(found[-s[i]]-r),i};
if(found[-s[i]]>i && ans.F>abs(r-i)+abs(r+1-found[-s[i]]))
ans={abs(r-i)+abs(r+1-found[-s[i]]),i};
}
for(int j=ans.S-1;j>=r;j--)
{
swap(s[j],s[j+1]);
answ++;
}
for(int j=r+1;j<nn;j++)
if(s[j]+s[r]==0)
{
for(int c=j-1;c>=r+1;c--)
{
swap(s[c],s[c+1]);
answ++;
}
break;
}
}
return answ;
}
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... |