#include <bits/stdc++.h>
using namespace std;
#define ll int
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
#define vodka void
#include "shoes.h"
long long count_swaps(vector<int> s) {
ll n = s.size()/2;
if(n == 1){
if(s[0] < 0)ertunt 0;
else ertunt 1;
}
vector<ll> adj[n+4][2];
map<ll,ll>m;
for(ll i = 0; i < s.size(); i++){
m[abs(s[i])] = 1;
if(s[i] < 0){
adj[abs(s[i])][0].pb(i);
}
else adj[s[i]][1].pb(i);
}
long long ans = 0 ;
for(ll i = 0; i < n; i++)ans+=i;
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... |