# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098361 | alexander707070 | Sorting (IOI15_sorting) | C++14 | 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>
#include "sorting.h"
#define MAXN 200007
using namespace std;
int n,m;
int pos[MAXN];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
n=N; m=M;
for(int i=0;i<n;i++){
pos[s[i]]=i;
}
for(int i=0;i<n;i++){
P[i]=i; Q[i]=pos[i];
swap(s[i],s[pos[i]]);
swap(pos[s[i]],pos[s[pos[i]]]);
}
return n;
}