# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014340 | KasymK | Arranging Shoes (IOI19_shoes) | C++17 | 1039 ms | 3164 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"
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
ll count_swaps(vector<int> v){
int n = (int)v.size();
ll ans = 0;
for(int i = 0; i < n-1; i+=2){
if(v[i] < v[i+1])
continue;
else if(v[i] > v[i+1])
swap(v[i], v[i+1]), ans++;
else{
int ad;
for(int j = i+1; j < n; ++j)
if(-v[i] == v[j]){
ad = j;
break;
}
for(int j = ad; j > i+1; --j)
swap(v[j], v[j-1]), ans++;
if(v[i] > 0)
swap(v[i], v[i+1]), ans++;
}
}
return ans;
}
// int main(){
// ll answer = count_swaps({-2, 2, 2, -2, -2, 2});
// printf("%lld\n", answer);
// }
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... |