# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830405 | mindiyak | 정렬하기 (IOI15_sorting) | C++17 | 3 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 <queue>
#include <vector>
#include <iostream>
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
int R=0;
int sorted = 0;
for(int i=0;i<N;i++)if(S[i] == i)sorted++;
// cout << sorted << endl;
while(sorted<N){
int dual = -1;
int pos = -1;
for(int i=0;i<N;i++){
if(S[i] == i)continue;
if(S[i] != i)pos = i;
// cout << i << " " << S[i] << " " << S[S[i]] << endl;
if(i == S[S[i]]){
dual = 1;
break;
}
}
sorted += 1;
swap(pos,S[pos]);
P[R] = pos;
Q[R] = S[pos];
R++;
// cout << "swap " << dual << " " << pos << " " << S[pos] << endl;
if(dual == 1){
sorted += 1;
}
}
return R;
}
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... |