# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045869 | Sputnik123 | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 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"
#define ll long long
using namespace std;
long long count_swaps(vector<ll> s) {
int n = s.size() / 2;
if(n == 1)
{
if(s[0] < 0) return 0;
return 1;
}
ll ans = 0;
for(ll i = 0; i < n ;i++)
ans += i;
return ans;
}