# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
196982 | Basilhijaz | Arranging Shoes (IOI19_shoes) | C++14 | 1026 ms | 3576 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 <int> a(s.size());
for(int i = 0; i < s.size(); i++){
if(s[i] < 0){
swaps += abs(i - (cnt * 2));
a[cnt*2] = s[i];
cnt++;
}
}
cnt = 0;
for(int i = s.size() - 1; i>=0; i--){
if(s[i]<0){
cnt++;
}
else if(i >= s.size() - (cnt*2) - 2){
s[i+cnt] = s[i];
s[i] = 0;
}
}
for(int i = 0; i < s.size(); i++){
if(s[i] > 0){
for(int j = 0; j < s.size(); j+=2){
if(a[j] == s[i]*-1){
swaps += abs((j+1) - i);
}
}
}
}
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... |