# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303562 | vipghn2003 | Arranging Shoes (IOI19_shoes) | C++14 | 1082 ms | 3064 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<bits/stdc++.h>
#include "shoes.h"
using namespace std;
const int N=1e5+5;
long long count_swaps(vector<int>a)
{
int n=a.size();
long long res=0;
for(int i=0;i<n;i+=2)
{
int id;
for(int j=2;j<=n;j++)
{
if(a[j]==-a[i])
{
id=j;
break;
}
}
for(int j=id;j>i+1;j--)
{
res++;
swap(a[j],a[j-1]);
}
if(a[i]>0) res++;
}
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... |