# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426938 | ollel | Sorting (IOI15_sorting) | C++17 | 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 <iostream>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define lso(x) x&(-x)
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define lso(x) x&(-x)
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
int findSwapPairs(int n, int S[], int M, int X[], int Y[], int P[], int Q[]) {
if (n == 1) return 0;
else if (n == 2) {
if (S[0] == 0) return 0;
P[0] = Q[0] = 0;
return 1;
}
int r = 0, s = 0;
rep(i,0,n) if (S[i] == i) s++;
if (s == n) return 0;
swap(S[0], S[1]);
rep(i, 0, n) if (S[i] == 0) {
swap(S[i], S[0]);
P[r] = 0;
Q[r] = i;
r++;
}
swap(S[0], S[1]);
rep(i, 0, n) if (S[i] == 1) {
swap(S[i], S[0]);
P[r] = 0;
Q[r] = i;
r++;
}
rep(i,2,n) {
while (S[i] != i) {
P[r] = i; Q[r] = S[i];
swap(S[0], S[1]);
swap(S[i], S[S[i]]);
r++;
}
}
if (S[0] != 0) {
swap(S[0], S[1]);
P[r] = Q[r] = 0;
r++;
}
return r;
}
int main() {
int n = 2;
int S[] = {0, 1};
int M;
int X[5], Y[5], P[5], Q[5];
cout << findSwapPairs(n, S, M, X, Y, P, Q) << endl;
rep (i, 0, 5) cout << P[i] << " " << Q[i] << endl;
}