# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830611 | Shithila | Sorting (IOI15_sorting) | C++14 | 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;
int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
int pos[N];
int ind=0;
for(int i=0;i<N;i++) pos[s[i]]=i;
for(int i=0;i<N;i++)
{
//ind++;
if(i==s[i]) continue;
P[ind]=i;
Q[ind]=pos[i];
int x=pos[i];
pos[i]=i;
pos[s[i]]=x;
s[x]=s[i];
s[i]=i;
ind++;
int k=s[0];
pos[s[0]]=1;
pos[s[1]]=0;
s[0]=s[1];
s[1]=k;
}
if(s[0]==1)
{
ind++;
P[ind]=0;
Q[ind]=1;
}
return ind;
}
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... |