#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
map<int,int> pos;
for (int i = 0; i < N; i++) {
pos[S[i]] = i;
}
int cnt = 0;
for (int i=0;i<N;i++) {
while (S[i] != i) {
int correct_pos=pos[i];
P[cnt]=i;
Q[cnt]=correct_pos;
cnt++;
pos[S[i]]=correct_pos;
pos[S[correct_pos]]=i;
swap(S[i], S[correct_pos]);
}
}
return cnt;
}
# | 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... |