Submission #970425

#	Time	Username	Problem	Language	Result	Execution time	Memory
970425		steveonalex	Permutation (APIO22_perm)	C++17	0 / 100	1 ms	344 KiB

perm

#include <bits/stdc++.h>
#include "perm.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

vector<int> construct_permutation(ll k){
    k--;
    vector<int> ans;
    for(int j = 60; j>=0; --j) if (k >= MASK(j+1) - 1){
        k -= MASK(j+1) - 1;
        for(int &i: ans) i += j + 1;
        for(int i = 0; i<=j; ++i) ans.push_back(i);
    }
    
    if (k == 1){
        for(int &i: ans) i += 1;
        ans.push_back(0);
    }
    return ans;
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     vector<int> perm = construct_permutation(3);
//     printArr(perm);

//     return 0;
// }

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