# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71482 | RezwanArefin01 | Sorting (IOI15_sorting) | C++17 | 4 ms | 384 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 "sorting.h"
using namespace std;
const int N = 2e5 + 10;
int p[N], pos[N];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
auto check = [&](int t) {
for(int i = 0; i < N; i++)
p[i] = S[i];
for(int i = 0; i <= t; i++)
swap(p[X[i]], p[Y[i]]);
for(int i = 0; i < N; i++)
pos[p[i]] = i;
int cnt = 0;
for(int i = 0; i < N; i++) {
if(p[i] != i) {
P[cnt] = i;
Q[cnt++] = pos[i];
int x = p[i];
swap(p[i], p[pos[i]]);
pos[x] = pos[i];
}
}
return cnt <= 1 + t;
};
int lo = 0, hi = M, ans = -1;
while(lo <= hi) {
int mid = lo + hi >> 1;
if(check(mid)) ans = mid, hi = mid - 1;
else lo = mid + 1;
}
check(ans);
return 1 + ans;
}
Compilation message (stderr)
# | 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... |