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>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 200005;
int n;
int a[N];
vector<int> l[N], r[N];
long long count_swaps(std::vector<int> s)
{
n = sz(s) / 2;
for (int i = 1; i <= n * 2; ++i)
a[i] = s[i - 1];
for (int i = 1; i <= n * 2; ++i)
{
if (a[i] < 0)
l[-a[i]].push_back(i);
else
r[a[i]].push_back(i);
}
ll ans = 0;
for (int i = 1; i <= n; ++i)
{
for (int j = 0; j < sz(l[i]); ++j)
{
if (l[i][j] < r[i][j])
ans += r[i][j] - l[i][j] - 1;
else
ans += l[i][j] - r[i][j];
}
}
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... |