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 "sorting.h"
#include "bits/stdc++.h"
using namespace std;
const int mxN = 2e5 + 7;
int n, m, arr[mxN];
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) {
arr[i] = S[i];
}
sort(S, S + n);
int R = 0, ind = 0;
bool subtask_3 = (Y[ind] != 0);
swap(arr[X[ind]], arr[Y[ind]]);
int start = 0;
if (subtask_3) {
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n; ++j) {
if (arr[j] == S[i] && j != 1) {
swap(arr[j], arr[1]);
P[ind] = j, Q[ind] = 1;
++R;
++ind;
break;
}
}
swap(arr[X[ind]], arr[Y[ind]]);
}
start = 2;
}
for (int iter = 1; iter <= 50; ++iter) {
for (int i = start; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (arr[j] == S[i] && i != j) {
swap(arr[j], arr[i]);
P[ind] = j, Q[ind] = i;
++R;
++ind;
break;
}
}
}
swap(arr[X[ind]], arr[Y[ind]]);
}
if (arr[0] != 0) {
P[ind] = 0, Q[ind] = 1;
++R;
++ind;
}
return R;
}
# | 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... |