# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259143 | IOrtroiii | Sorting (IOI15_sorting) | C++14 | 1 ms | 384 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>
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
int ans = 0;
vector<int> invp(N);
for (int i = 0; i < N; ++i) invp[S[i]] = i;
for (int i = 0; i < N; ++i) {
if (S[i] == i) continue;
int j = invp[i];
P[ans] = i;
Q[ans++] = j;
swap(S[i], S[j]);
invp[S[i]] = i;
invp[S[j]] = j;
}
return ans;
/*
auto solve = [&](int mid) -> bool {
vector<int> perm(N);
for (int i = 0; i < N; ++i) {
perm[i] = S[i];
}
for (int i = 0; i < mid; ++i) swap(perm[X[i]], perm[Y[i]]);
vector<int> invp(N);
for (int i = 0; i < N; ++i) invp[perm[i]] = i;
int ans = 0;
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... |