# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832694 | HorizonWest | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 212 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 <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pb push_back
#define fs first
#define sd second
#define all(x) x.begin(), x.end()
#define Mod long(1e9 + 7)
const int Max = 1e6 + 7, Inf = 1e9 + 7;
struct ABI
{
vector <int> s;
void update(int x, int k)
{
x = max(1, x);
for(x; x < (int) s.size(); x += (x & -x))
s[x] += k;
}
int sum(int x)
{
int ans = 0;
for(x; x > 0; x -= (x & -x))
ans += s[x];
return ans;
}
int query(int l, int r)
{
if(l == 0) return sum(r);
return sum(r) - sum(l-1);
}
ABI(int n)
{
s.assign(n+1, 0);
}
};
long long count_swaps(std::vector<int> s)
{
int n = (int) s.size(), ans = 0;
vector <deque<int>> v(n+1, deque <int> ());
for(int i = 0; i < n; i++)
v[abs(s[i]) + (s[i] > 0 ? n/2 : 0)].push_back(i);
vector <int> pass(n+1, 0); ABI St(n+2);
for(int i = 0; i < n; i++) if(!pass[i])
{
int x = v[abs(s[i])].front(), y = v[abs(s[i]) + n/2].front();
v[abs(s[i])].pop_front();
v[abs(s[i]) + n/2].pop_front();
pass[x] = pass[y] = 1;
int x1 = St.query(0, x), y1 = St.query(0, y);
St.update(x, 1); St.update(y, -1);
if(x > y)
ans += (x - y);
else
ans += (y - (x + 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... |