# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
804111 | _martynas | Sorting (IOI15_sorting) | C++11 | 5 ms | 468 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 T[N];
for (int i = 0; i < N; i++) T[i] = S[i];
for (int i = 0; i < M; i++) swap(T[X[i]], T[Y[i]]);
for (int i = 0; i < M; i++) P[i] = Q[i] = 0;
vector<pair<int, int>> swap_list;
for (int i = 0; i < N; i++) {
if (T[i] != i) {
swap_list.emplace_back(i, T[i]);
for (int j = i+1; j < N; j++) {
if (T[j] == i) {
swap(T[i], T[j]);
}
}
}
}
for (int i = 0; i < (int)swap_list.size(); i++) {
swap(S[X[i]], S[Y[i]]);
int a, b;
for (int j = 0; j < N; j++) {
if (S[j] == swap_list[i].first) a = j;
if (S[j] == swap_list[i].second) b = j;
}
P[i] = a;
Q[i] = b;
swap(S[a], S[b]);
}
return M;
}
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... |