# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
368101 | leinad2 | Arranging Shoes (IOI19_shoes) | C++17 | 1086 ms | 2668 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;
long long count_swaps(vector<int>s)
{
long long ans=0;
int i, j;
for(i=0;i<s.size();i++)
{
if(i%2==0)
{
if(s[i]<0)continue;
for(j=i+1;j<s.size();j++)
{
if(s[j]<0)break;
}
while(j>i)
{
swap(s[j], s[j-1]);
ans++;
j--;
}
}
else
{
if(s[i]==-s[i-1])continue;
for(j=i+1;j<s.size();j++)
{
if(s[j]==-s[i-1])break;
}
while(j>i)
{
swap(s[j], s[j-1]);
ans++;
j--;
}
}
}
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... |