# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752779 | jampm | 정렬하기 (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 "sorting.h"
#include <bits/stdc++.h>
using namespace std;
const int LOGN = 30;
int count_cycles(vector<int> & V, int N = 0) {
N = ssize(V); int ans = 0;
vector<bool> vis(N, false);
for (int i = 0; i < N; i++) {
if (vis[i]) continue;
ans++;
for (int j = V[i]; i != j; j = V[j]) vis[j] = true;
}
return ans;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
int ans = 0;
for (int k = LOGN; k >= 0; k--) {
if (ans + (1<<k) > M) continue;
vector<int> V(N);
for (int i = 0; auto &e : V) e = S[i++];
for (int i = 0; i < ans + (1<<k); i++) {
swap(V[X[i]], V[Y[i]]);
}
if (count_cycles(V) + ans + (1<<k) < N) ans += (1<<k);
}
ans++;
vector<int> V(N);
for (int i = 0; auto &e : V) e = S[i++];
for (int i = 0; i < ans; i++) {
swap(V[X[i]], V[Y[i]]);
}
vector<bool> vis(N, false);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (vis[i]) continue;
P[cnt] = i, Q[cnt] = vis[i]; cnt++;
for (int j = V[i]; i != j; j = V[j]) {
P[cnt] = j, Q[cnt] = vis[j]; cnt++;
}
}
return ans;
}