# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745620 | Dan4Life | Sorting (IOI15_sorting) | C++17 | 1 ms | 340 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 mxN = (int)2e5+10;
int n, m, a[mxN], pos[mxN];
void swp(int a[], int i, int j){
if(i==j) return;
swap(pos[a[i]],pos[a[j]]), swap(a[i],a[j]);
}
int findSwapPairs(int N, int a[], int M, int x[], int y[], int P[], int Q[]) {
n = N, m = M; int num = 0;
if(is_sorted(a,a+n)) return 0;
for(int i = 0; i < n; i++) pos[a[i]] = i;
for(int i = 0; i < m; i++) swp(a,x[i],y[i]);
for(int i = 0; i < n; i++){
if(pos[i]==i) continue;
P[num] = i, Q[num++] = pos[i];
swp(a,i,pos[i]);
}
for(int i = 0; i < m; i++) swp(a,x[i],y[i]);
for(int i = 0; i < num; i++) swp(a,P[i],Q[i]);
for(int i = 0; i < num; i++){
swp(a,x[i],y[i]);
if(is_sorted(a,a+n)) return i;
swp(a,P[i],Q[i]);
}
return num;
}
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... |