# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320716 | knon0501 | Sorting (IOI15_sorting) | C++14 | 495 ms | 25060 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 MX=2e5+5;
int a[MX];
int b[MX];
int c[MX];
int d[MX];
int dd[MX];
int e[MX];
int p[MX];
int q[MX];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
P[0] = 0;
Q[0] = 0;
int i,j,k;
int ret=N;
int lef=0;
int rig=N-1;
while(rig>=lef){
int mid=(lef+rig)/2;
for(i=0 ; i<N ; i++){
a[i]=b[i]=S[i];
e[a[i]]=i;
}
for(i=0 ; i<mid ; i++){
p[i]=q[i]=0;
swap(b[X[i]],b[Y[i]]);
}
for(i=0 ; i<N ; i++)
c[b[i]]=i;
for(i=0 ; i<N ; i++)
d[i]=c[a[i]],dd[d[i]]=i;
int j=0;
for(i=0 ; i<mid ; i++){
swap(dd[d[X[i]]],dd[d[Y[i]]]);
swap(e[a[X[i]]],e[a[Y[i]]]);
swap(d[X[i]],d[Y[i]]);
swap(a[X[i]],a[Y[i]]);
while(j<N && e[j]==dd[j]){
j++;
}
if(j<N){
int k=a[dd[j]];
p[i]=e[j];
q[i]=dd[j];
swap(a[e[j]],a[dd[j]]);
swap(e[j],e[k]);
}
}
int isok=1;
for(i=0 ; i<N ; i++){
if(i!=a[i])isok=0;
}
if(isok==1){
rig=mid-1;
ret=mid;
for(i=0 ; i<mid ; i++)
{
P[i]=p[i];
Q[i]=q[i];
}
}
else
lef=mid+1;
}
return ret;
}
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... |