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>
#include "shoes.h"
using namespace std;
const int N = 2e5 + 10;
deque<int> pos[N], neg[N];
int r[N], bit[N];
void update(int x) {
for(++x; x > 0; x -= x & -x)
++bit[x];
}
int read(int x) {
int ret = 0;
for(++x; x < N; x += x & -x)
ret += bit[x];
return ret;
}
long long count_swaps(vector<int> s) {
exit(0);
}
# | 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... |