제출 #1207742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207742		countless	The Collection Game (BOI21_swaps)	C++20	0 / 100	0 ms	412 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//

#include "swaps.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;

#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);

// concurrent sorts
// https://en.wikipedia.org/wiki/Batcher_odd%E2%80%93even_mergesort
void solve(int n, int v) {
    // 60%
    vector<int> at(n);
    iota(all(at), 1);

    vector<pair<int, int>> queries;
    auto in = [&](int x) -> bool {
        // return (0 < x and x <= n);
        return (0 <= x and x < n);
    };

    unordered_set<int> have;
    int offset = 0;
    auto reset = [&]() -> void {
        have.clear(), queries.clear();
    };

    auto query = [&](int a, int b) -> void {
        if (!in(a) or !in(b) or a == b) {
            return;
        }

        if ((have.count(a) == 0) and (have.count(b) == 0)) {
            have.insert(a), have.insert(b);
            schedule(at[a], at[b]);
        } else {
            queries.push_back({a, b});
        }
    };


    auto handle = [&]() -> void {
        vector<int> res = visit();

        while (!queries.empty()) {
            vector<pair<int, int>> temp;
            have.clear();
            for (int i = 0; i < queries.size(); i++) {
                auto [a, b] = queries[i];
                if ((have.count(a) == 0) and (have.count(b) == 0)) {
                    have.insert(a), have.insert(b);
                    schedule(at[a], at[b]);
                } else {
                    temp.push_back({a, b});
                }
            }

            queries.clear();
            queries.swap(temp);
            res = visit();
        }
    };

    for (int p = 1; p < n; p++) {
        for (int k = p; k > 0; k /= 2) {
            reset();

            for (int j = k % p; j < n - k; j += 2 * k) {
                for (int i = 0; i < min(p, n-j-k); i++) {
                    if (floor((i+j) / (p*2)) == floor((i+j+k) / (p*2))) {
                        query(i+j, i+j+k);
                    }
                }
            }
            
            handle();
        }
    }

    // int pw2 = 1;
    // while (pw2 < n) pw2 <<= 1;
    // pw2 <<= 1;

    // for (int k = 2; k <= pw2; k *= 2) {
    //     for (int j = k/2; j > 0; j /= 2) {
    //         for (int i = 0; i < pw2; i++) {
    //             int l = i ^ j;
    //             if (l > i) {
    //                 query(i, l, i & k);
    //             }
    //         }

    //         handle();
    //     }
    // }

    // reverse(all(at));
    answer(at);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3-1: 0 / 3
• Subtask 3-2: 0 / 2
• Subtask 4-1: 0 / 9
• Subtask 4-2: 0 / 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