# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633097 | kkkkkkkk | Arranging Shoes (IOI19_shoes) | C++14 | 1 ms | 212 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)
{
int n=s.size()/2;
if (n==2)
{
if (s[0]<0) return 0;
else return 1;
}
long long ans=0;
bool poseteni[n]={0};
for (int i=0;i<s.size();i++)
{
if (poseteni[i]==1)
continue;
for (int j=i+1;j<s.size();j++)
{
if (s[j]+s[i]==0&&poseteni[j]==0)
{
if (s[i]>0)
ans+=j-i;
else
ans+=j-i-1;
poseteni[j]=1;
break;
}
}
}
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... |