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