# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60060 | Eae02 | Sorting (IOI15_sorting) | C++14 | 3 ms | 512 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 "sorting.h"
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
std::vector<int> sorted(S, S + N);
std::sort(all(sorted));
std::vector<int> finalAccess(N);
for (int i = 0; i < M; i++)
{
finalAccess[X[i]] = i;
finalAccess[Y[i]] = i;
}
int R = 0;
for (; R < M; R++)
{
if (std::equal(S, S + N, sorted.begin()))
break;
std::swap(S[X[R]], S[Y[R]]);
auto it = std::find_if(all(finalAccess), [&](int a) { return R >= a; });
if (it == finalAccess.end())
{
P[R] = Q[R] = 0;
continue;
}
int index = it - finalAccess.begin();
int val = sorted[index];
auto valIt = std::find(S, S + N, index);
std::swap(S[index], *valIt);
P[R] = index;
Q[R] = valIt - S;
}
return R;
}
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... |