# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108011 | Aviansh | Sorting (IOI15_sorting) | C++17 | 85 ms | 77644 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;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
int be[n];
iota(be,be+n,0);
int ber[m][n];
for(int i = m-1;i>=0;i--){
if(x[i]!=y[i])
swap(be[x[i]],be[y[i]]);
int temp[n];
for(int i = 0;i<n;i++){
temp[be[i]]=i;
}
copy(temp,temp+n,ber[i]);
}
int r = 0;
for(int i = 0;i<n;i++){
if(x[i]!=y[i])
swap(s[x[i]],s[y[i]]);
int ind = find(s,s+n,i)-s;
p[r]=ind;
q[r]=(i);
swap(s[ind],s[i]);
r++;
continue;
if(ind!=ber[r+1][i])
swap(s[ind],s[ber[r+1][i]]);
p[r]=ind;
q[r]=(ber[r+1][i]);
r++;
}
// for(;r<m;r++){
// p[r]=0;
// q[r]=0;
// if(x[r]!=y[r])
// swap(s[x[r]],s[y[r]]);
//}
for(int i = 0;i<n;i++){
assert(s[i]==i);
}
return r;
}
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... |