# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197053 | Basilhijaz | Arranging Shoes (IOI19_shoes) | C++14 | 2 ms | 400 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(std::vector<int> s) {
int cnt = 0; long long swaps = 0;
vector <pair<int, int> > a(s.size());
for(int i = 0; i < s.size(); i++){
a[i].first = s[i];
a[i].second = i;
}
for(int i = 0; i < s.size(); i++){
if(s[i] < 0){
swaps += abs(i - (cnt * 2));
cnt++;
for(int j = 0; j < s.size(); j++){
if(s[j] == s[i]*-1){
swaps += abs(j - (cnt*2) + 1);
s[j] = 0;
}
}
}
}
return swaps;
}
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... |