# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597754 | PiejanVDC | Sorting (IOI15_sorting) | C++17 | 2 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[]) {
vector<int>v(n);
for(int i = 0 ; i < n ; i++)
v[s[i]] = i;
auto sorted = [&] () -> bool {
for(int i = 0 ; i < n ; i++)
if(s[i] != i)
return 0;
return 1;
};
for(int i = 0 ; i < n ; i++) {
if(sorted())
return i;
P[i] = i, Q[i] = v[i];
swap(v[i], v[s[i]]);
swap(s[i], s[v[s[i]]]);
}
return n;
}
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... |