# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520723 | peti1234 | Sorting (IOI15_sorting) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
for (int i=0; i<n; i++) {
for (int j=i; j<n; j++) {
if (s[j]==i) {
p[i]=i, q[i]=j;
swap(s[i], s[j])
}
}
}
return n;
}