# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444319 | blue | 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 <vector>
using namespace std;
void solve(int N, int V)
{
vector<int> r(N);
for(int i = 1; i <= N; i++) r[i - 1] = i;
for(int v = 1; v <= min(V, N); v++)
{
if(v % 2 == 0)
{
for(int i = 0; i+1 < N; i += 2) schedule(r[i], r[i+1]);
vector<int> C = visit();
for(int i = 0; i+1 < N; i += 2)
if(C[i/2] == 0)
swap(r[i+1], r[i]);
}
else
{
for(int i = 1; i+1 < N; i += 2) schedule(r[i], r[i+1]);
vector<int> C = visit();
for(int i = 0; i+1 < N; i += 2)
if(C[i/2] == 0)
swap(r[i+1], r[i]);
}
}
return r;
}