| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 960511 | vjudge1 | Arranging Shoes (IOI19_shoes) | C++17 | 279 ms | 29952 KiB |
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 "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define all(v) v.begin(),v.end()
#define pb push_back
struct FWT{
vector<ll> bit;
FWT(ll n){
bit.resize(n + 69);
}
ll lsb(ll i){
return (-i) & i;
}
void modify(ll i,ll v){
for(i++;i<bit.size();i += lsb(i))bit[i] += v;
}
ll query(ll i){
ll ans = 0;
for(i++;i;i -= lsb(i))ans += bit[i];
return ans;
}
};
ll count_swaps(vector<int> A) {
ll n = A.size();
map<ll,vector<ll> > ind;
for(ll i = 0;i<n;i++)ind[A[i]].pb(i);
for(auto &u : ind)reverse(u.second.begin(), u.second.end());
ll o[n];
memset(o, -1, sizeof o);
for(ll i = 0;i<n;i++){
if(o[i] != -1)continue;
if(A[i] < 0){
o[i] = 2 * i + 1;
o[ind[-A[i]].back()] = 2 * i + 2;
}else{
o[i] = 2 * i + 2;
o[ind[-A[i]].back()] = 2 * i + 1;
}
ind[A[i]].pop_back();
ind[-A[i]].pop_back();
}
ll ans = 0;
FWT fwt(2 * n);
for(ll i = n-1;i>=0;i--){
ans += fwt.query(o[i] - 1);
fwt.modify(o[i], 1);
}
return ans;
}
Compilation message (stderr)
| # | 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... | ||||
