# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434619 | Maqsut_03 | Sorting (IOI15_sorting) | C++14 | 2 ms | 716 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 S[500500];
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] = s[i];
int r = 0;
for (int i=0; i<N; i++)
for (int j=i; j<N; j++)
{
if (S[i] > S[j]) {
swap(S[i], S[j]); P[r] = i; Q[r] = j; r++;
}
}
return M;
}
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... |