# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317929 | keta_tsimakuridze | Sorting (IOI15_sorting) | C++14 | 307 ms | 21992 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>
#define f first
#define s second
#include "sorting.h"
using namespace std;
int findSwapPairs(int N, int A[], int M, int x[], int y[], int P[], int Q[]) {
int l=0; int r=M;
std::vector<std::pair<int,int> > V,ans;
int a[N+5],ind[N+5];
while(l<=r){
V.clear();
int mid=(l+r)/2;
for(int i=0;i<N;i++){
ind[A[i]]=i;
a[i]=A[i];
}
for(int i=0;i<mid;i++){
std::swap(a[x[i]],a[y[i]]);
}
for(int i=0;i<N;i++){
ind[a[i]]=i;
}
for(int i=0;i<N;i++){
if(a[i]!=i){
V.push_back(std::make_pair(a[i],i));
std::swap(a[i],a[ind[i]]);
std::swap(ind[a[ind[i]]],ind[i]);
}
}
for(int i=0;i<N;i++){
a[i]=A[i];
ind[a[i]]=i;
}
if(V.size()<=mid) {
ans.clear();
for(int i=0;i<mid;i++){
std::swap(ind[a[x[i]]],ind[a[y[i]]]);
std::swap(a[x[i]],a[y[i]]);
if(i<V.size() ){
// V[i].f V[i].s
swap(ind[V[i].f],ind[V[i].s]);
swap(a[ind[V[i].f]],a[ind[V[i].s]]);
ans.push_back(make_pair(ind[V[i].f],ind[V[i].s]));
}
else ans.push_back(make_pair(0,0));
}
r=mid-1;
}
else l=mid+1;
}
for(int i=0;i<ans.size();i++){
P[i]=ans[i].first;
Q[i]=ans[i].second;
}
return ans.size();
}
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... |