Submission #1005447

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005447		GrindMachine	The Collection Game (BOI21_swaps)	C++17	25 / 100	33 ms	680 KiB

swaps

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read the edi a long time back, remember some key ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "swaps.h"

int on;

vector<int> bitonic_sort(vector<int> &a){
    int siz = sz(a);
    if(siz <= 1) return a;

    vector<pii> cmp;

    rep(i,siz/2){
        int j = i+siz/2;

        if(a[i] > on){
            swap(a[i],a[j]);
        }
        else if(a[j] > on){

        }
        else{
            schedule(a[i],a[j]);
            cmp.pb({i,j});
        }
    }

    auto res = visit();
    rep(i,sz(res)){
        if(!res[i]){
            swap(a[cmp[i].ff],a[cmp[i].ss]);
        }
    }

    vector<int> b,c;
    rep(i,siz){
        if(i < siz/2){
            b.pb(a[i]);
        }
        else{
            c.pb(a[i]);
        }
    }

    b = bitonic_sort(b);
    c = bitonic_sort(c);

    trav(x,c) b.pb(x);
    return b;
}

vector<int> sort(vector<int> &a){
    int siz = sz(a);
    if(siz <= 1) return a;
    vector<int> b,c;
    rep(i,siz){
        if(i < siz/2){
            b.pb(a[i]);
        }
        else{
            c.pb(a[i]);
        }
    }

    b = sort(b);
    c = sort(c);
    reverse(all(c));
    trav(x,c) b.pb(x);

    return bitonic_sort(b);
}

void solve(int on_, int V) {
    on = on_;
    int n = 1;
    while(n < on) n <<= 1;

    vector<int> a(n);
    iota(all(a),1);

    auto ans = sort(a);
    while(sz(ans) > on) ans.pop_back();

    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