#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[]){
vector<int> f(N), g(N);
for (int i=0; i<N; i++){
f[i] = i;
g[i] = i;
}
for (int i=0; i<M; i++){
//swap(f[X[i]], f[Y[i]]);
int g1 = g[X[i]], g2 = g[Y[i]];
swap(g[X[i]], g[Y[i]]);
swap(f[g1], f[g2]);
}
//for (int i=0; i<N; i++) cout << f[i] << " " << g[i] << endl;
vector<int> v(N);
for (int i=0; i<N; i++) v[f[i]] = S[i];
for (int i=0; i<M; i++){
int f1 = f[X[i]], f2 = f[Y[i]];
swap(f[X[i]], f[Y[i]]);
swap(g[f1], g[f2]);
//for (int i2=0; i2<N; i2++) cout << f[i2] << " " << g[i2] << endl;
P[i] = 0;
Q[i] = 0;
for (int j=0; j<N; j++){
if (v[j] != j){
P[i] = f[j];
Q[i] = f[v[j]];
break;
}
}
}
return M;
}
