# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704874 | cig32 | The Collection Game (BOI21_swaps) | C++17 | 0 ms | 0 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 "swaps.h"
#include "bits/stdc++.h"
using namespace std;
void solve(int N, int V) {
// TODO implement this function
for(int i=1; i<=10; i++) {
for(int j=(1 << ((int) log2(N))); j>=1; j>>=1) {
for(int k=1; k<=N; k+=(j<<1)) {
for(int l=k; l<k+j; l++) {
if((k<<1) + (j<<1) - 1 - l <= N) schedule(k + k+(j<<1)-1 - l, l);
}
}
vector<int> uni = visit();
}
for(int j=2; j+1<=N; j+=2) {
schedule(j+1,j);
}
vector<int> uni = visit();
}
for(int i=1; i<=N; i++) cout << A[i] << " \n"[i == N];
vector<int> identity;
for(int i=1; i<=N; i++) identity.push_back(i);
answer(identity);
}