Submission #1277045

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277045		al95ireyiz	Permutation (APIO22_perm)	C++20	0 / 100	1 ms	336 KiB

perm

#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define in insert
#define sc second
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9, INFL = 1e18;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll maxn = 2e5 + 5;

ll n, m, k = 0;

std::vector<int> construct_permutation(long long _k)
{
    m = _k;
    vector<int> v, cv;
    if(__builtin_popcount(m) == 1){
        for(ll i = 1; (1LL << i) <= m; i ++){
            cv.pb(i - 1);
        }
        return cv;
    }
    m --; // bos coxluq
    ll cm = 0;
    while(m){
        ll l = 1, r = INF, cv;
        while(l <= r){
            ll md = (l + r) >> 1;
            if(md * (md + 1) / 2 <= m){
                cv = md, l = md + 1;
            }
            else{
                r = md - 1;
            }
        }
        v.pb(cv);
        m -= cv * (cv + 1) / 2;
        cm += cv;
    }
    for(auto i : v){
        for(ll j = cm - i + 1; j <= cm; j ++){
            // cout << j << ' ';
            cv.pb(j - 1);
        }
        cm -= i;
    }
    return cv;
}
// void _() {
//     ll q;
//     cin >> q;
//     auto v = construct_permutation(q);
//     for(auto i : v) cout << i << ' ' ;
// }
// signed main() {
//     ll tm = clock();
//     cin.tie(0)->sync_with_stdio(0);
//     ll t = 1;
//     // cin >> t;
//     for(ll tt = 1; tt <= t; tt ++) _();
//     cerr << "\n\033[1;31mTime: \033[1;30m" \
//         << (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
// }

• Subtask 1: 0 / 10
• Subtask 2: 0 / 90