# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600020 | PiejanVDC | Sorting (IOI15_sorting) | C++17 | 1076 ms | 364 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[]) {
auto sorted = [&] () -> bool {
for(int i = 0 ; i < n ; i++)
if(s[i] != i)
return 0;
return 1;
};
for(int T = 1 ; T <= m ; T++) {
vector<int>c(n);
for(int i = 0 ; i < n ; i++) c[i]= i;
for(int i = 0 ; i < T ; i++)
swap(c[X[i]], c[Y[i]]);
vector<int>go(n);
for(int i = 0 ; i < n ; i++) {
go[c[i]] = i;
}
vector<int>v(n);
auto S = [&] (int W) {
for(int i = 0 ; i < n ; i++)
if(v[i] == W)
return i;
assert(0);
};
for(int i = 0 ; i < n ; i++) v[i] = s[i];
int cnt = 0;
for(int i = 0 ; i < T ; i++) {
cnt++;
swap(v[X[i]], v[Y[i]]);
swap(go[X[i]], go[Y[i]]);
int j;
for(j = 0 ; j < n ; j++) {
if(go[j] != v[j]) {
int p = S(go[j]);
P[cnt-1] = p;
Q[cnt-1] = i;
swap(v[p], v[j]);
break;
}
}
if(j == n)
P[cnt] = 0, Q[cnt] = 0;
// do the swappings
// look for first element not correct in go
}
if(sorted())
return cnt;
}
}
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... |