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 forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define GR(a,n,m) vector<vector<int>> a(n, vector<int>(m, 0));
ll count_swaps(vector<int> s)
{
int n = sz(s);
ll ans = 0;
for(int i = 0;i < n;i+=2){
int p = i;
for(int j = i;j < n;j++){
if(s[j] < 0){
p = j;
break;
}
}
for(int j = p;j > i;j--){
swap(s[j], s[j - 1]);
++ans;
}
}
for(int i = 1;i < n;i+=2)
{
int p = i;
for(int j = i;j < n;j++){
if(s[j] > 0 && abs(s[j]) == abs(s[i - 1])){
p = j;
break;
}
}
for(int j = p;j > i;j--){
swap(s[j], s[j - 1]);
++ans;
}
}
return ans;
}
# | 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... |