# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69395 | yusufake | Sorting (IOI15_sorting) | C++98 | 537 ms | 13048 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>
using namespace std;
#include "sorting.h"
#define pb push_back
#define mp make_pair
#define mx 200005
int T[mx],W[mx],A[mx],B[mx],i,l,m,r,t;
int findSwapPairs(int n, int *S, int M, int *X, int *Y, int *P, int *Q){
l = 0;
r = n;
for(; l<r ;){
m = l+r >> 1;
for(i=0;i<n;i++){
W[ S[i] ] = i;
T[i] = S[i];
P[i] = Q[i] = 0;
}
for(i=0;i<m;i++)
swap(T[ X[i] ], T[ Y[i] ]);
t = 0;
for(i=0;i<n;i++)
for(; T[i] != i ; ){
A[t] = T[ T[i] ];
B[t] = T[i];
t++;
swap(T[ T[i] ] , T[i]);
}
for(i=0;i<n;i++) T[i] = S[i];
for(i=0;i<m;i++){
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... |