#include "shoes.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
long long count_swaps(vector<int> s) {
int res=0;
while(!s.empty()){
int cur = s[0];
int nm=0;
for(int i = 1;i<s.size();i++){
if (s[i]==-cur){
nm=i;
break;
}
}
s.erase(s.begin()+nm);
s.erase(s.begin());
res+=nm-1;
if(cur>0)res++;
}
return res;
}
| # | 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... |