# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434641 | Maqsut_03 | Sorting (IOI15_sorting) | C++14 | 2 ms | 844 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 S[555555];
int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]){
for (int i = 0 ; i<N;i++) S[i] = (int)s[i];
int R = 0;
//for (int j=0;j<N;j++) cout <<S[j] << ' ' ; cout << endl;
for (int i = 0 ; i< N; i++) {
for (int j = 1; j < N; j++) {
if (S[j-1] > S[j]) {
int tmp = 0;
//std::swap(S[j-1], S[j]);
tmp = S[j-1];
S[j-1] = S[j];
S[j] = tmp;
P[R] = j-1;
Q[R] = j;
//std::cout << j-1 << ' ' << j <<std:: endl;
R++;
}
}
//for (int j=0;j<N;j++) cout <<S[j] << ' ' ; cout << endl;
//cout << i << endl;
}
assert(R<=M);
for (int i = 0;i<N;i++) {
assert(S[i]==i);
}
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... |