# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240870 | RayaBurong25_1 | Arranging Shoes (IOI19_shoes) | C++17 | 806 ms | 147128 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 <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <cassert>
int abs(int a)
{
return (a < 0)?-a:a;
}
int ismoved[200005] = {0};
int query(int p)
{
p++;
int r = 0;
for (; p > 0; p -= p&-p)
r += ismoved[p];
return r;
}
void update(int p)
{
p++;
for (; p < 200005; p += p&-p)
ismoved[p]++;
}
long long count_swaps(std::vector<int> s) {
int i, sz, norp;
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... |