# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075133 | ArthuroWich | Sorting (IOI15_sorting) | C++17 | 2 ms | 600 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 p[], int M, int X[], int Y[], int P[], int Q[]) {
vector<pair<int, int>> ans;
int d = 0;
for (int i = n-1; i >= 0; i--) {
if (p[i] == i) {
continue;
}
while(p[i] != i) {
int j = p[i];
ans.push_back({i, j});
swap(p[i], p[j]);
bool f = 1;
for (int l = 0; l < n; l++) {
if (p[l] != l) {
f = 0;
}
}
if (f) {
break;
}
int x = X[d], y = Y[d];
swap(p[x], p[y]);
d++;
}
}
for (int i = 0; i < ans.size(); i++) {
P[i] = ans[i].first;
Q[i] = ans[i].second;
}
return ans.size();
}
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... |