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;
long long count_swaps(vector<int> s){
long long n = s.size(), ans = 0;
for(int i=0;i<n;i+=2)
{
for(int j=i+1;j<n;j++)
{
if(s[i] + s[j] == 0)
{
ans += j - i - 1;
for(int k=j-1;k>=i+1;k--) swap(s[k], s[k+1]);
break;
}
}
if(s[i] > s[i + 1])
{
ans += 1;
swap(s[i], s[i + 1]);
}
}
return ans;
}
// int main(){
// int n;
// cin >> n;
// vector<int> t(2*n);
// for(int i=0;i<2*n;i++) cin >> t[i];
// cout << count_swaps(t) << '\n';
// }
| # | 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... |