# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468640 | PiejanVDC | Arranging Shoes (IOI19_shoes) | C++17 | 1100 ms | 1868 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>v) {
int fixed = -1, n = v.size();
long long ans = 0;
while(fixed < 2*n-1) {
int right,pos;
for(int i = fixed+1 ; i < n ; i++) {
if(v[i] < 0) {
right = -v[i],pos=i;
break;
}
}
for(int i = pos-1 ; i > fixed ; i--) {
ans++;
swap(v[i],v[i+1]);
}
for(int i = fixed+1 ; i < n ; i++) {
if(v[i] == right) {
pos=i;
break;
}
}
for(int i = pos-1 ; i > fixed+1 ; i--) {
ans++;
swap(v[i],v[i+1]);
}
fixed+=2;
}
return ans;
}
/*
signed main() {
int n; cin>>n;
vector<int>v(n);
for(auto &z : v)
cin >> z;
cout << count_swaps(v);
}*/
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... |