| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1102921 | MateiKing80 | The Collection Game (BOI21_swaps) | C++14 | 6 ms | 804 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>
#include "swaps.h"
using namespace std;
const int MAXN = 50;
vector<array<int, 2>> ops[MAXN];
int sz, n;
int bitonic(int l, int r, bool inc, int lvl, bool isbitonic)
{
if(l == r)
return lvl - 1;
int md = (l + r) >> 1, mx = lvl - 1;
if(!isbitonic)
{
mx = bitonic(l, md, inc, lvl, 0);
bitonic(md + 1, r, !inc, lvl, 0);
}
for(int i = l; i <= md; i++)
{
int x = i, y = i + md + 1 - l;
if(!inc)
ops[mx + 1].push_back({x, y});
else
ops[mx + 1].push_back({y, x});
}
bitonic(l, md, inc, mx + 2, 1);
return bitonic(md + 1, r, inc, mx + 2, 1);
}
void solve(int N, int v)
{
n = N;
if(n == 1)
{
answer({1});
return;
}
sz = 1 << (__lg(n - 1) + 1);
vector<int> a(sz);
for(int i = 0; i < sz; i++)
a[i] = i + 1;
int dep = bitonic(0, sz - 1, 1, 0, 0);
assert(dep < MAXN);
for(int j = 0; j < MAXN; j ++)
{
if(ops[j].empty()) continue;
for(auto [x, y] : ops[j])
if(a[x] <= n && a[y] <= n)
schedule(a[x], a[y]);
vector<int> ret = visit();
int cnt = 0;
for(auto [x, y] : ops[j])
{
if(a[x] > n)
continue;
if(a[y] > n)
{
swap(a[x], a[y]);
continue;
}
if (ret[cnt])
swap(a[x], a[y]);
cnt ++;
}
}
while(a.size() > n)
a.pop_back();
answer(a);
}
Compilation message (stderr)
| # | 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... | ||||
