# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421116 | LouayFarah | Sorting (IOI15_sorting) | C++14 | 1 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 "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;
bool flag = true;
for(int k = 0; k<n; k++)
{
for(int i = 0; i<n-1; i++)
{
if(sorted(s, n))
{
flag = false;
break;
}
if(s[i]>s[i+1])
{
p[res] = i;
q[res] = i+1;
swap(s[i], s[i+1]);
res++;
}
}
if(!flag)
break;
}
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... |