# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1041985 | fv3 | Sorting (IOI15_sorting) | C++14 | 2 ms | 348 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 findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
if (N == 1)
return 0;
// X[i] = Y[i] = 0
int cnt = 0;
for (int i = 0; i < N; i++)
{
int l = 2;
for (; l < N; l++)
{
if (S[l] != l)
break;
}
if (l == N)
{
break;
}
swap(S[0], S[1]);
cnt++;
P[i] = (i == 1 ? 0 : i);
for (int j = 0; j < N; j++)
{
if (S[j] == i)
{
Q[i] = j;
if (i != j)
swap(S[P[i]], S[j]);
}
}
}
if (S[0] == 0)
return cnt;
P[cnt] = 0;
Q[cnt] = 0;
return cnt+1;
}
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... |