# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420941 | LouayFarah | Sorting (IOI15_sorting) | C++14 | 2 ms | 832 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;
bool sorted(int s[], int n)
{
int i = 0;
while(i<n)
{
if(s[i]!=i)
return false;
i++;
}
return true;
}
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
{
int res = 0;
for(int i = 1; i<=n; i++)
{
int j = i;
while(s[j]<s[j-1]&&j>0)
{
if(sorted(s, n))
break;
if(x[res]!=y[res])
swap(x[res], y[res]);
p[res] = j;
q[res] = j-1;
res++;
swap(s[j], s[j-1]);
j--;
}
}
return res;
}
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... |