Submission #1217650

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217650		lrnnz	The Collection Game (BOI21_swaps)	C++20	25 / 100	11 ms	416 KiB

swaps

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include "swaps.h"
using namespace std;
 
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
 
/********* DEBUG *********/
 
template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<

/********* DEBUG *********/

const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll inf = 1e18;
const ll mxN = 2000005;

// using: https://en.wikipedia.org/wiki/Batcher_odd%E2%80%93even_mergesort
void solve(int N, int V){
    vector<int> ans(N);
    iota(all(ans), 1);

    vector<pair<int,int>> s;
    ll curr = 1;
    while (curr < N){
        for (int k = curr; k >= 1; k/=2){
            for (int j = k % curr; j <= N-1-k; j += 2*k){
                s.clear();

                for (int i = 0; i < min(k, N-j-k); i++)
                    if (floor((i+j) / (curr*2)) == floor((i+j+k) / (curr*2)))
                        schedule(ans[i+j], ans[i+j+k]), s.push_back({i+j, i+j+k});

                vector<int> z = visit();
                for (int i = 0; i < z.size(); i++)
                    if (z[i]^1)
                        swap(ans[s[i].first], ans[s[i].second]);
            }
        }

        curr *= 2;
    }

    answer(ans);
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3-1: 3 / 3
• Subtask 3-2: 2 / 2
• Subtask 4-1: 9 / 9
• Subtask 4-2: 6 / 6
• Subtask 5-1: 0 / 9
• Subtask 5-2: 0 / 6
• Subtask 6-1: 0 / 21
• Subtask 6-2: 0 / 14
• Subtask 7-1: 0 / 9
• Subtask 7-2: 0 / 6