# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420791 | LouayFarah | Sorting (IOI15_sorting) | C++14 | 1 ms | 332 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[])
{
int i = 0;
while(i<n)
{
bool sorted = true;
int curr = 0;
while(curr<0)
{
if(s[curr]!=curr)
{
sorted = false;
break;
}
curr++;
}
if(sorted)
break;
int j = i;
int mini = n;
int ind = j;
while(j<n)
{
if(s[j]<mini)
{
mini = s[j];
ind = j;
}
j++;
}
p[i] = i, q[i] = ind;
swap(s[i], s[ind]);
i++;
}
return i;
}
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... |