# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830533 | Minindu206 | Sorting (IOI15_sorting) | C++14 | 1 ms | 340 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[])
{
int dif = 0;
vector<int> pos(n, 0);
for(int i=0;i<n;i++)
{
pos[s[i]] = i;
}
int ind = 0;
for(int i=0;i<n;i++)
{
// for(int j=0;j<n;j++)
// cout << s[j] << " ";
// cout << '\n';
if(s[i] != i)
{
cout << i << '\n';
p[ind] = i;
q[ind] = pos[i];
pos[i] = i;
pos[s[i]] = s[i];
s[q[ind]] = s[i];
s[i] = i;
ind++;
}
// for(int j=0;j<n;j++)
// cout << s[j] << " ";
// cout << '\n';
}
return ind;
}
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... |