# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426264 | duality | The Collection Game (BOI21_swaps) | C++14 | 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 <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#include "swaps.h"
int used[500];
void solve(int N,int V) {
int i,j;
vi order;
for (i = 0; i < N; i++) order.pb(i+1);
int s = sqrt(N);
for (j = 0; j < N; j++) {
vi v1,v2;
/*for (i = s; i < N; i++) {
if (!used[i-s]) v1.pb(i),schedule(order[i-s],order[i]),used[i-s] = used[i] = 1;
else v2.pb(i);
}
fill(used,used+N,0);
vi r = visit();
for (i = 0; i < r.size(); i++) {
if (!r[i]) swap(order[v1[i]-s],order[v1[i]]);
}
for (i = 0; i < v2.size(); i++) schedule(order[v2[i]-s],order[v2[i]]);
r = visit();
for (i = 0; i < r.size(); i++) {
if (!r[i]) swap(order[v2[i]-s],order[v2[i]]);
}*/
v1.clear(),v2.clear();
for (i = 1; i < N; i++) {
if (i & 1) schedule(order[i-1],order[i]),v1.pb(i);
else v2.pb(i);
}
r = visit();
for (i = 0; i < r.size(); i++) {
if (!r[i]) swap(order[v1[i]-1],order[v1[i]]);
}
for (i = 0; i < v2.size(); i++) schedule(order[v2[i]-1],order[v2[i]]);
r = visit();
for (i = 0; i < r.size(); i++) {
if (!r[i]) swap(order[v2[i]-1],order[v2[i]]);
}
}
answer(order);
}