# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850727 | AliHasanli | Arranging Shoes (IOI19_shoes) | C++17 | 1096 ms | 1996 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<iostream>
#include<vector>
using namespace std;
long long count_swaps(vector<int> s)
{
if(s.size()==2)
{
if(s[0]>s[1])return 1;
return 0;
}
long long ans=0;
int find_matchshoe=1;
for(int i=0;i<s.size();i+=2)
{
for(int j=i+1;j<s.size();j++)
if(s[i]==-s[j])
{
find_matchshoe=j;
break;
}
for(int j=find_matchshoe;j>i+1;j--)
{
swap(s[j],s[j-1]);
ans++;
}
if(s[i]>s[i+1]){swap(s[i],s[i+1]);ans++;}
}
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... |