This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 42;
int fw[N];
void add(int k, int x) {
for(; k < N; k += (k & -k)) fw[k] += x;
}
int get(int k) {
int res = 0;
for(; k > 0; k -= (k & -k)) res += fw[k];
return res;
}
ll count_swaps(vector<int> s) {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n = s.size();
map<int, set<int> > posr;
vector<pair<int, int> > posl;
for(int i = 0; i < n; i++)
if(s[i] > 0) posr[s[i]].insert(i + 1);
else posl.pb(mp(i + 1, -s[i]));
ll ans = 0;
for(int i = 1; i <= n; i += 2) {
int cur = posl[i / 2].se;
int cpos = posl[i / 2].fi + get(n) - get(posl[i / 2].fi);
ans += abs(cpos - i);
add(cpos, 1);
int cposr = *posr[cur].begin(); posr[cur].erase(posr[cur].begin());
cposr += get(n) - get(cposr);
ans += abs(cposr - (i + 1));
add(cposr, 1);
}
return ans;
return 0;
}
/*
*/
Compilation message (stderr)
shoes.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
3 | #pragma GCC optimization ("unroll-loops")
|
# | 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... |