#include <bits/stdc++.h>
#include "swaps.h"
using namespace std;
void solve(int N, int V) {
vector<int> ans;
for (int i = 1; i <= N; i++) {
ans.push_back(i);
}
for (int i = 0; i < 500; i++) {
int j;
if (i % 2) {
j = 2;
} else {
j = 1;
}
for (int k = j; k < N-1; k+=2) {
schedule(ans[k-1], ans[k]);
}
vector<int> res = visit();
for (int k = 0; k < res.size(); k++) {\
//the corresponding indices are j-1+2*k, j+2*k
if (res[k] == 0) {
swap(ans[j-1+2*k],ans[j+2*k]);
}
}
}
answer(ans);
}
# | 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... |
# | 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... |