# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087020 | the_coding_pooh | Sorting (IOI15_sorting) | C++14 | 1 ms | 604 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>
#define uwu return 0;
using namespace std;
const int SIZE = 2e5 + 5;
int s[SIZE], tar[SIZE], x[SIZE], y[SIZE], p[SIZE], q[SIZE], pos_of_val[SIZE];
void build(int M){
for(int i = M - 1; i >= 0; i--){
swap(tar[x[i]], tar[y[i]]);
}
return;
}
void get_sequence(int N, int M){
for(int i = 0; i < M; i++){
swap(s[x[i]], s[y[i]]);
for(int j = 0; j < N; j++){
pos_of_val[s[j]] = j;
}
swap(tar[x[i]], tar[y[i]]);
for(int j = 0; j < N; j++){
if(s[j] != tar[j]){
swap(s[j], s[pos_of_val[tar[j]]]);
p[i] = j;
q[i] = pos_of_val[tar[j]];
break;
}
}
}
return;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
int cnt = 0;
for(int i = 0; i < N; i++){
if(S[i] != i){
for(int j = i + 1; j < N; j++){
if(S[j] == i){
P[cnt] = i;
Q[cnt] = j;
cnt++;
swap(S[i], S[j]);
break;
}
}
}
}
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... |