# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520777 | Richw818 | Arranging Shoes (IOI19_shoes) | C++17 | 128 ms | 140812 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;
const int MAXN = 200005;
struct bit{
vector<int> sum;
bit(){
sum.resize(MAXN);
}
void update(int i, int v){
while(i < MAXN){
sum[i] += v;
i += i & (-i);
}
}
int query(int i){
int res = 0;
while(i){
res += sum[i];
i -= i & (-i);
}
return res;
}
};
int64_t count_swaps(vector<int> S){
int n = S.size();
n >>= 1;
vector<deque<int>> pos(n+1), neg(n+1);
vector<int> occ(n + 1);
for(int i = 0; i < 2 * n; ++i){
# | 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... |