Submission #941673

#	Time	Username	Problem	Language	Result	Execution time	Memory
941673		GrindMachine	Permutation (APIO22_perm)	C++17	100 / 100	6 ms	472 KiB

perm

#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

/*

refs:
https://codeforces.com/blog/entry/103229?#comment-917449

*/

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

#include "perm.h"

vector<int> go(ll k){
	assert(k);
	if(k == 1) return {};
	if(k == 2) return {0};
	if(k == 3) return {1,0};

	auto a = go(k/4);
	ll x = k%4;
	ll n = sz(a);

	if(x == 0){
		a.pb(n);
		a.pb(n+1);
	}
	else if(x == 1){
		a.pb(n);
		a.pb(n+1);
		a.pb(-1);
	}
	else if(x == 2){
		a.pb(n);
		a.pb(-1);
		a.pb(n+1);
	}
	else{
		ll pos0 = find(all(a),0)-a.begin();
		ll pos1 = find(all(a),1)-a.begin();
		if(pos0 > pos1){
			a.pb(n);
			a.pb(n+1);
			trav(x,a){
				if(x > 1){
					x++;
				}
			}
			a.pb(2);
		}
		else{
			a.pb(n);
			a.pb(-1);
			a.pb(n+1);
			a.pb(-2);
		}
	}

	auto b = a;
	sort(all(b));
	trav(x,a){
		x = lower_bound(all(b),x)-b.begin();
	}

	return a;
}

vector<int> construct_permutation(long long k)
{
	return go(k);
}

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