# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
743779 | Abrar_Al_Samit | Sorting (IOI15_sorting) | C++17 | 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 <bits/stdc++.h>
#include "sorting.h"
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
if(N<3) {
if(N==1) return 0;
//swap(S[X[0]], S[Y[0]]);
if(S[0]<S[1]) {
return 0;
} else {
P[0] = 0, Q[0] = 1;
return 1;
}
}
int at[N];
for(int i=0; i<N; ++i) {
at[S[i]] = i;
}
for(int i=0; i<N-2; ++i) {
// swap(S[X[i]], S[Y[i]]);
// at[S[0]] = 0;
// at[S[1]] = 1;
int pos = N-i-1;
if(at[pos]==pos) {
P[i] = Q[i] = 0;
} else {
P[i] = at[pos], Q[i] = pos;
at[S[pos]] = at[pos];
swap(S[pos], S[at[pos]]);
at[pos] = pos;
}
if(i==N-3) {
if(at[0]==0) return i+1;
else {
if(Y[i]) {
P[i+1] = Q[i+1] = 0;
} else {
P[i+1] = 0, Q[i+1] = 1;
}
return i+2;
}
}
}
}
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... |