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 <bits/stdc++.h>
using namespace std;
#include "swaps.h"
void solve(int n,int v){
int rnks[n+1];
for(int i = 1;i<=n;i++)rnks[i] = i;
bool odd = 0;
int its = n*2;
while(its--){
int st = odd+1;
for(;st<n;st+=2){
schedule(st,st+1);
}
vector<int> vis = visit();
st = odd+1;int ind = 0;
for(;st<n;st+=2){
if(!vis[ind])swap(rnks[st],rnks[st+1]);
ind++;
}
odd = !odd;
}vector<int> lol;
for(int i = 1;i<=n;i++){
lol.push_back(rnks[i]);
}
answer(lol);
}
# | 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... |